Construction of Hamiltonian cycles in layered cubic planar graphs

Graphs and Combinatorics

Volumn 18, Issue 2, 2002, Pages 259-270

  Franzblau, D S ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Circuit; Cubic; Cycle; Edge coloring; Hamiltonian; Planar graph; Three regular

Indexed keywords

EID: 0036910054     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730200019     Document Type: Article

References (11)

1. Alspach, B., Zhang, C-Q.: Hamilton cycles in cubic Cayley graphs on dihedral groups. Ars Combinatoria 28, 101-108 (1989)
2. Barnette, D.: Map Coloring, Polyhedra, and the Four Color Problem. Dolciani Expositions, MAA 1984
3. Bollobás, B.: Graph Theory. NY: Springer-Verlag 1979
4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. NY: North Holland 1976
5. Franzblau, D.S.: A new class of Hamiltonian cubic planar graphs. Graph Theory Notes NY 34, 18-21 (1998)
6. Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman 1979
7. Nash-Williams, C.St.J.A.: Hamiltonian circuits. In: D.P. Fulkerson: Studies in Graph Theory (Vol. 2 pp. 301-360) MAA 1975
8. Saaty, T.L.: Thirteen colorful variations on Guthrie's four-color conjecture. Am. Math. Mon. 79, 2-43 (1972)
9. Tait, P.G.: Remarks on the colouring of maps. Proc. R. Soc., Edinb., 10, 729 (1880)
10. Tutte, W.T.: On Hamiltonian circuits. J. Lond. Math. Soc. 21, 98-101 (1946)
11. Wang, J-J., Sung, T-Y., Hsu, L-H.: A family of optimal 1-Hamiltonian graphs with diameter O(log n). (preprint)