论文信息 - Hamilton paths in toroidal graphs

Hamilton paths in toroidal graphs

Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grunbaum and Nash-Williams independently conjectured that the same is true for toroidal graphs. In this paper, we prove that every 4-connected toroidal graph contains a Hamilton path.

Robin Thomas | Xingxing Yu | Wenan Zang

[1] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[2] Carsten Thomassen,et al. A theorem on paths in planar graphs , 1983, J. Graph Theory.

[3] B. Grünbaum. Polytopes, graphs, and complexes , 1970 .

[4] Robin Thomas,et al. Five-Connected Toroidal Graphs Are Hamiltonian , 1997, J. Comb. Theory, Ser. B.

[5] Xingxing Yu,et al. 4-Connected Projective-Planar Graphs Are Hamiltonian , 1994, J. Comb. Theory, Ser. B.

[6] Amos Altshuler,et al. Hamiltonian circuits in some maps on the torus , 1972, Discret. Math..

[7] H. Whitney. A Theorem on Graphs , 1931 .

[8] Richard Brunet,et al. Hamiltonicity of 5-Connected Toroidal Triangulations , 1995, J. Graph Theory.