The following publications are possibly variants of this publication:
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphsJinquan Xu, Ping Li, Zhengke Miao, Keke Wang, Hong-Jian Lai. ijcm, 91(8):1662-1672, 2014. [doi]
- Circumferences and Minimum Degrees in 3-Connected Claw-Free GraphsMingChu Li, Liming Xiong. endm, 22:93-99, 2005. [doi]
- Circumferences and minimum degrees in 3-connected claw-free graphsMingChu Li, Yongrui Cui, Liming Xiong, Yuan Tian, He Jiang, Xu Yuan. DM, 309(11):3580-3587, 2009. [doi]
- Hamiltonian properties of 3-connected {claw, hourglass}-free graphsZdenek Ryjácek, Petr Vrána, Liming Xiong. DM, 341(6):1806-1815, 2018. [doi]
- Every 3-connected claw-free ::::Z::::::8::-free graph is HamiltonianHong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan. jgt, 64(1):1-11, 2010. [doi]