Degree Sequence Condition for Hamiltonicity in Tough Graphs
Journal of Graph Theory · 26.07.2026
DOI: 10.1002/jgt.70102 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 26.07.2026. Verfasst von Songling Shan und 1 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Gefördert von: Division of Mathematical Sciences.
Abstract (Originalsprache)
Generalizing both Dirac's condition and Ore's condition for Hamilton cycles, Chvátal in 1972 established a degree sequence condition for the existence of a Hamilton cycle in a graph. Hoàng in 1995 generalized Chvátal's degree sequence condition for 1‐tough graphs and conjectured a ‐tough analog for any positive integer . Hoàng in the same paper verified his conjecture for and recently Hoàng and Robin verified the conjecture for . In this paper, we confirm the conjecture for all . The proof depends on two newly established results on cycle structures in tough graphs, which hold independent interest.
Förderung
- Division of Mathematical Sciences
Zitieren
APA
Shan, S., & Tanyel, A. (2026). Degree Sequence Condition for Hamiltonicity in Tough Graphs. Journal of Graph Theory. https://doi.org/10.1002/jgt.70102
Vancouver
Shan S, Tanyel A. Degree Sequence Condition for Hamiltonicity in Tough Graphs. Journal of Graph Theory. 2026. doi:10.1002/jgt.70102
BibTeX
@article{Shan2026,
author = {Shan, Songling and Tanyel, Arthur},
title = {Degree Sequence Condition for Hamiltonicity in Tough Graphs},
journal = {Journal of Graph Theory},
year = {2026},
doi = {10.1002/jgt.70102}
}
EUVIMED