论文信息 - Hamiltonicity of 5-Connected Toroidal Triangulations - 字舞流文

Hamiltonicity of 5-Connected Toroidal Triangulations

In this article, we prove that a 5-connected toroidal triangulation has a contractible Hamilton cycle. © 1995 John Wiley & Sons, Inc.

Richard Brunet | R. Bruce Richter

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

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

[3] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[4] Norishige Chiba,et al. A theorem on paths in planar graphs , 1986 .

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

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

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

[8] David W. Barnette. Decomposition theorems for the torus, projective plane and Klein bottle , 1988, Discret. Math..

[9] Carsten Thomassen,et al. Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.