643 search results - page 8 / 129 » Supereulerian planar graphs |
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
JACM
2002
13 years 7 months ago
2002
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planar...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...