Proof of a conjecture on hamiltonian-connected graphs
Petr Vrána, Xingzhi Zhan, Leilei Zhang · arXiv (Cornell University) · 2021
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.