641 search results - page 60 / 129 » On Planar Quasi-Parity Graphs |
188
click to vote
DCG
2011
15 years 1 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
170
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
152
click to vote
DM
2008
15 years 6 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
181
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
176
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...