On the necessity of Chvátal’s Hamiltonian degree condition

DOI10.1080/09728600.2020.1834337zbMath1471.05056OpenAlexW3096274623MaRDI QIDQ5012357

Linda Lesniak, Edward F. Schmeichel, A. Nevo, Douglas Bauer

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2020.1834337

zbMATH Keywords

degree conditionforcibly \(k\)-connected degree sequenceforcibly Hamiltonian degree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Best monotone degree conditions for graph properties: a survey
• Efficient counting of degree sequences
• On Hamilton's ideals
• Tough graphs and Hamiltonian circuits.
• The strongest monotone degree condition for \(n\)-connectedness of a graph
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item