On Hamilton Cycles in Certain Planar Graphs

Journal of Graph Theory

Volumn 21, Issue 1, 1996, Pages 43-50

  Sanders, Daniel P ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030530916     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199601)21:1<43::AID-JGT6>3.0.CO;2-M     Document Type: Article

References (8)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York (1976).
2. N. Chiba and T. Nishizeki, The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs, J. Algorithms 10 (1989), 187-211.
3. M. B. Dillencourt, Hamiltonian cycles in planar triangulations with no separating triangles, J. Graph Theory 14 (1990), 31-49.
4. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Computing 2 (1973), 135-158.
5. C. Thomassen, A theorem on paths in planar graphs. J. Graph Theory 7 (1983), 169-176.
6. W. T. Tutte, A theorem on planar graphs, Trans. Am. Math. Soc. 82 (1956), 99-116.
7. W. T. Tutte, Graph Theory, Addison-Wesley, Menlo Park, California (1984).
8. H. Whitney, A theorem on graphs, Ann. Math. 32 (1931), 378-390.