Proof of a conjecture on hamiltonian-connected graphs
Combinatorics
2021-12-01 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2110.15519,
title = {Proof of a conjecture on hamiltonian-connected graphs},
author = {Petr Vrana and Xingzhi Zhan and Leilei Zhang},
journal= {arXiv preprint arXiv:2110.15519},
year = {2021}
}