English

Cycle Extendability of Hamiltonian Strongly Chordal Graphs

Discrete Mathematics 2021-07-06 v3 Combinatorics

Abstract

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 22-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer kk such that all kk-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry's is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle extendable graphs two more graph classes, namely, Hamiltonian 44-\textsc{fan}-free chordal graphs where every induced K5eK_5 - e has true twins, and Hamiltonian {4\textscfan,A}\{4\textsc{-fan}, \overline{A} \}-free chordal graphs.

Keywords

Cite

@article{arxiv.2007.04698,
  title  = {Cycle Extendability of Hamiltonian Strongly Chordal Graphs},
  author = {Guozhen Rong and Wenjun Li and Jianxin Wang and Yongjie Yang},
  journal= {arXiv preprint arXiv:2007.04698},
  year   = {2021}
}

Comments

14 pages, 6 figures. [v3]: To appear in SIDMA