Hamiltonicity of Regular 2-Connected Graphs

Journal of Graph Theory

Volumn 22, Issue 2, 1996, Pages 105-124

  Broersma, H J ^a   Van Den Heuvel, J ^b   Jackson, B ^c   Veldman, H J ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030537084     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-R     Document Type: Article

References (16)

1. J. A. Bondy and V. Chvátal, A method in graph theory, Discrete Math. 15 (1976), 111-135.
2. J. A. Bondy and M. Kouider, Hamilton cycles in regular 2-connected graphs, J. Combin. Theory B 44 (1988), 177-186.
3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York (1976).
4. H. J. Broersma, J. van den Heuvel, H. A. Jung, and H. J. Veldman, Cycles containing all vertices of maximum degree, J. Graph Theory 17 (1993), 373-385.
5. H. J. Broersma, J. van den Heuvel, and H. J. Veldman, A generalization of Ore's Theorem involving neighborhood unions, Discrete Math. 122 (1993), 37-49.
6. G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. (3) 2 (1952), 69-81.
7. F. Hilbig, Kantenstrukturen in nichthamiltonschen Graphen. Ph.D. Thesis, Technische Universität Berlin (1986).
8. B. Jackson, Hamilton cycles in regular 2-connected graphs, J. Combin. Theory B 29 (1980), 27-46.
9. B. Jackson, H. Li, and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Math. 102 (1991), 163-176.
10. Min Aung, Circumference of a regular graph, J. Graph Theory 13 (1989), 149-155.
11. λ-paths, Discrete Math. 44 (1983), 309-316.
12. M. E. Watkins and D. M. Mesner, Cycles and connectivity in graphs, Can. J. Math. 19 (1967), 1319-1328.
13. D. R. Woodall, The binding number of a graph and its Anderson number, J. Combin. Theory B 15 (1973), 225-255.
14. Y. Zhu and H. Li, Hamilton cycles in regular 3-connected graphs, Discrete Math. 110 (1992), 229-249.
15. Y. Zhu, Z. Liu, and Z. Yu, 2-Connected k-regular graphs on at most 3k + 3 vertices to be hamiltonian, J. Sys. Sci. & Math. Sci. 6 (1) (1986), 36-19; (2) (1986), 136-145.
16. Y. Zhu, Z. Liu, and Z. Yu, 2-Connected k-regular graphs on at most 3k + 3 vertices to be hamiltonian, J. Sys. Sci. & Math. Sci. 6 (1) (1986), 36-19; (2) (1986), 136-145.