A closure lemma for tough graphs and Hamiltonian degree conditions

DOI10.1016/j.disc.2024.113872arXiv2303.03479WikidataQ124884665 ScholiaQ124884665MaRDI QIDQ6197740

Cléophée Robin, Chính T. Hoàng

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.03479

zbMATH Keywords

Hamiltonian cyclestoughness of graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• 10-tough chordal graphs are Hamiltonian
• A method in graph theory
• Hamiltonian degree conditions for tough graphs
• Not every 2-tough graph is Hamiltonian
• Closure concepts: A survey
• On Hamilton's ideals
• Tough graphs and Hamiltonian circuits.
• On Maximal Circuits in Finite Graphs

This page was built for publication: A closure lemma for tough graphs and Hamiltonian degree conditions