98 search results - page 4 / 20 » Planar Cycle Covering Graphs |
DM
2006
13 years 5 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
COCO
2010
Springer
13 years 2 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
DM
2002
13 years 5 months ago
2002
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
SIAMDM
2008
13 years 4 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...