Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

作者：Vrana, Petr; Zhan, Xingzhi^*; Zhang, Leilei

来源：Discrete Mathematics, 2022, 345(8): 112909.

DOI：10.1016/j.disc.2022.112909

• Hamiltonian-connected
• Claw-free
• Domination number

We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020.