<--- Back to Details
First PageDocument Content
Planar graphs / Graph operations / Crossing number / Inequalities / Graph / Apex graph / Dual graph / Petersen graph / String graph / Graph theory / Mathematics / Topological graph theory
Date: 2010-06-29 15:34:29
Planar graphs
Graph operations
Crossing number
Inequalities
Graph
Apex graph
Dual graph
Petersen graph
String graph
Graph theory
Mathematics
Topological graph theory

Add to Reading List

Source URL: www.fmf.uni-lj.si

Download Document from Source Website

File Size: 523,65 KB

Share Document on Facebook

Similar Documents

Graph theory / Planar graphs / Graph operations / Graph minor / Dual graph / Graph / Apex graph / Tree / Vertex / Skew partition / Line graph / Pathwidth

Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

DocID: 1pSEP - View Document

Planar graphs / Graph operations / Apex graph / Minor / Crossing number / Rotation system / Homeomorphism / Dual graph / Degree / Graph theory / Mathematics / Topological graph theory

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Petr Hlinˇ en´ y1 and Markus Chimani2 1

DocID: 17QQE - View Document

Connectivity / SPQR tree / Apex graph / Shortest path problem / Breadth-first search / Crossing number / Graph theory / Mathematics / Planar graphs

A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1

DocID: 17zx5 - View Document

Outerplanar graph / Tree decomposition / Minor / Graph / Tree / Apex graph / Line graph / Graph theory / Planar graphs / Graph operations

Weizmann Institute of Science Thesis for the degree Master of Science Submitted to the Scientific Council of the Weizmann Institute of Science Rehovot, Israel

DocID: 16bav - View Document

NP-complete problems / Graph operations / Tree decomposition / Vertex cover / Minor / Planar graph / Dynamic programming / Path decomposition / Apex graph / Graph theory / Theoretical computer science / Mathematics

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs

DocID: 13hhP - View Document