Vertices of Small Degree in Uniquely Hamiltonian Graphs

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 2, 1998, Pages 265-275

  Bondy, J A ^a   Jackson, Bill ^b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037607036     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1845     Document Type: Article

References (18)

1. Barefoot C. A., Entringer R. C. Extremal maximal uniquely Hamiltonian graphs. J. Graph Theory. 4:1980;93-100.
2. Bondy J. A. Basic graph theory: Paths and circuits. Handbook of Combinatorics. 1995;North-Holland, Amsterdam. p. 3-110.
3. Bosák J. Hamiltonian lines in cubic graphs. Rosenstiehl P. Theory of Graphs. 1967;35-46 Gordon & Breach, New York.
4. Dirac G. A. Some theorems on abstract graphs. Proc. London Math. Soc. 2:1952;69-81.
5. Entringer R. C., Swart H. Spanning cycles of nearly cubic graphs. J. Combin. Theory Ser. B. 29:1980;303-309.
6. Erdös P., Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions. Hajnal A. Infinite and Finite Sets. 1975;609-628 North-Holland, Amsterdam.
7. Fleischer H. Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs. J. Graph Theory. 18:1994;449-459.
8. Jackson B., Whitty R. W. A note concerning graphs with uniquef. J. Graph Theory. 13:1989;577-580.
9. Petersen J. Die Theorie der regulären Graphs. Acta Math. 15:1891;193-220.
10. Sheehan J. Problem Section, Proc. Fifth British Combinatorial Conf. Nash-Williams C. St. J. A., Sheehan J. Congr. Numer. 1975;691-691 Utilitas Math. Winnipeg.
11. Sheehan J. The multiplicity of Hamiltonian circuits in a graph. Fiedler M. Recent Advances in Graph Theory. 1975;447-480 Academia, Prague.
12. Thomas R., Yu X. 4-connected projective planar graphs are Hamiltonian. J. Combin. Theory Ser. B. 62:1994;114-132.
13. Thomason A. G. Hamilton cycles and uniquely 3-edge colourable graphs. Bollobás B. Advances in Graph Theory. Ann. Discrete Math. 3:1978;259-268 North-Holland, Amsterdam.
14. Thomassen C. On the number of Hamiltonian cycles in bipartite graphs. Combinatorics, Probab. Comput. 5:1996;437-442.
15. C. Thomassen, Chords of longest cycles in cubic graphs, J. Combin. Theory Ser. B.
16. C. Thomassen, Independent dominating sets and a second Hamiton cycle in regular graphs, J. Combin. Theory Ser. B.
17. Tutte W. T. On hamiltonian circuits. J. London Math. Soc. 21:1946;98-101.
18. Tutte W. T. A theorem on planar graphs. Trans. Amer. Math. Soc. 82:1956;99-116.