A generalization of a theorem of Nash-Williams
@article{Bauer2021AGO, title={A generalization of a theorem of Nash-Williams}, author={Douglas Bauer and Linda M. Lesniak and Edward F. Schmeichel}, journal={Graphs and Combinatorics}, year={2021}, volume={38} }
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≥5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage…
References
SHOWING 1-10 OF 10 REFERENCES
Seven criteria for integer sequences being graphic
- MathematicsJ. Graph Theory
- 1991
Seven criteria for integer sequences being graphic are listed and one of the criteria leads to a new and constructive proof of the well-known criterion of Erdos-Gallai.
Graphs with prescribed degrees of vertices (Hungarian)
- Mat. Lapok 11, 264– 274
- 1960
A theorem concerning Hamilton lines
- Magyar Tud. Akad. Mat. Kutató Int. Közl. 7
- 1962
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Bondy Properties of graphs with constraints on degrees
- Studia Sci. Math. Hungar
- 1969
Graphs & Digraphs, 6th edn
- CRC Press, Boca Raton
- 2016