Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-23T22:30:27.560Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Structure of Non-Hamiltonian Graphs I

Published online by Cambridge University Press:  12 September 2008

Roland Häggkvist
Roland Häggkvist
Affiliation:
Department of Mathematics, University of Umeå, S-90187 Umeå, Sweden
Get access Rights & Permissions [Opens in a new window]

Abstract

The structure of non-Hamiltonian graphs is studied in terms of neighbourhood-unions. Numerous results, such as (A), (B) and (C) below, are obtained.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 1 , Issue 1 , March 1992 , pp. 27 - 34
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Dirac, G. A.. Some theorems on abstract graphs. Proc. London Math. Soc., Ser. 3 2 (1952), 69–81.CrossRefGoogle Scholar
[2] Häggkvist, R.. A characterization of non-hamiltonian graph with high degrees. Annals Discrete Math. 9 (1980) 259.Google Scholar
[3] Jackson, B.. Hamilton cycles in regular 2-connected graphs. J. Combinatorial Theory Ser. B 29 (1980) 27–46.Google Scholar
[4] Nash-Williams, C. St.J.A.. Edge-disjoint Hamiltonian circuits in graphs with large valency. In “Studies in Pure Mathematics” (Mirsky, L., ed.). Academic Press, London (1971), 157–183.Google Scholar
[5] Thomassen, C.. Planar cubic hypo-Hamiltonian and hypotracable graphs. J. Combinatorial Theory Ser. B 30 (1981) 36–44.Google Scholar
[6] Woodall, D. R.. The binding number of a graph and its Anderson number. J. Combinatorial Theory Ser. B 15 (1973) 225–255.CrossRefGoogle Scholar