21 search results - page 1 / 5 » Hamilton Cycles in Planar Locally Finite Graphs |
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...
JCT
2006
13 years 5 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
Book
A well-written book about graph theory.
Book
A classic book on graph theory.
CORR
2011
Springer
13 years 9 days ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...