2000 character limit reached
Degree sequence condition for Hamiltonicity in tough graphs
Published 8 May 2024 in math.CO | (2405.04728v3)
Abstract: Generalizing both Dirac's condition and Ore's condition for Hamilton cycles, Chvatal in 1972 established a degree sequence condition for the existence of a Hamilton cycle in a graph. Hoang in 1995 generalized Chvatal's degree sequence condition for 1-tough graphs and conjectured a t-tough analogue for any positive integer t at least 1. Hoang in the same paper verified his conjecture for t at most 3 and recently Hoang and Robin arXiv:2303.03479v2 verified the conjecture for t = 4. In this paper, we confirm the conjecture for all t at least 4.
- Long cycles in graphs with prescribed toughness and minimum degree. Discrete mathematics, 141(1-3):1–10, 1995.
- Graph theory with applications. American Elsevier Publishing Co., Inc., New York, 1976.
- V. Chvátal. On hamilton’s ideals. Journal of Combinatorial Theory, Series B, 12(2):163–168, 1972.
- V. Chvátal. Tough graphs and hamiltonian circuits. Discrete Mathematics, 5(3):215–228, 1973.
- C. T. Hoà ng. Hamiltonian degree conditions for tough graphs. Discrete mathematics, 142(1-3):121–139, 1995.
- C. T. Hoà ng and C. Robin. A closure lemma for tough graphs and hamiltonian degree conditions. Discrete Mathematics, 347(4):113872, 2024.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.