A Proof to Bang‐Jensen, Havet and Yeo's Conjecture on the Hamiltonian Cycles Avoiding Prescribed Arcs in Semicomplete Digraphs
ABSTRACT In 2023, Bang‐Jensen, Havet and Yeo [J. Graph Theory 102 (2023) 578‐606] conjectured that every ‐strong semicomplete digraph contains a hamiltonian cycle avoiding any prescribed set of arcs, which was inspired by the result of Fraisse and Thomassen that, every ‐strong tournament contains a hamiltonian cycle avoiding any prescribed set of arcs. In this paper, we prove the conjecture.
Authors
- Xinhong Zhang (ORCID: https://orcid.org/0000-0003-2403-4777)
- Yaoxiang Di
- Ruiping Zhang (ORCID: https://orcid.org/0000-0001-6922-0747)
- Ruijuan Li (ORCID: https://orcid.org/0000-0001-8062-3459)
Institutions
- Shanxi University (CN)
- Taiyuan University of Science and Technology (CN)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1002/jgt.23256
- Citations
- 1
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 1.50