21 search results - page 2 / 5 » Hamilton Cycles in Planar Locally Finite Graphs |
117
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
102
click to vote
COMBINATORICA
2004
14 years 11 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
COMBINATORICA
2010
14 years 6 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
COMBINATORICS
2004
14 years 11 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
75
Voted
EJC
2007
14 years 11 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...