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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。