Abstract
Chvátal (J Combin Theory Ser B 12:163–168, 1972) gave a well-known sufficient condition for a graphical sequence to be forcibly hamiltonian, and showed that in some sense his condition is best possible. Nash-Williams (Recent Trends in Graph Theory. Springer, Berlin, pp. 197–210, 1971) gave examples of forcibly hamiltonian n-sequences that do not satisfy Chvátal’s condition, for every \(n\ge 5\). In this note we generalize the Nash-Williams examples, and use this generalization to generate \(\varOmega \left( \frac{2^n}{\sqrt{n}} \right) \) forcibly hamiltonian n-sequences that do not satisfy Chvátal’s condition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy, J.A.: Properties of graphs with constraints on degrees. Studia Sci. Math. Hungar. 4, 473–475 (1969)
Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–136 (1976)
Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 6th edn. CRC Press, Boca Raton (2016)
Chvátal, V.: On Hamilton’s ideals. J. Combin. Theory Ser. B 12, 163–168 (1972)
Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)
Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices (Hungarian). Mat. Lapok 11, 264–274 (1960)
Nash-Williams, C.St.J.A.: Hamiltonian arcs and circuits. In: Recent Trends in Graph Theory. Lecture Notes in Mathematics 186, pp. 197–210. Springer, Berlin (1971)
Pósa, L.: A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7, 225–226 (1962)
Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph Theory 15, 223–231 (1991)
Funding
The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There are no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Bauer, D., Lesniak, L. & Schmeichel, E. A generalization of a theorem of Nash-Williams. Graphs and Combinatorics 38, 184 (2022). https://doi.org/10.1007/s00373-022-02588-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-022-02588-7