|
|||||
|
|
On Hamiltonicity of 3-Connected Claw-Free Graphs |
|
| Authors: | Runli Tian Liming Xiong Zhaohong Niu |
| Institution: | 1. School of Mathematics, Beijing Institute of Technology, Beijing, 100081, People’s Republic of China 2. Department of Mathematics, Qinghai University for Nationalities, Xining, 810000, People’s Republic of China 3. School of Mathematical Sciences, Shanxi University, Taiyuan, 030006, People’s Republic of China |
| Abstract: | Lai, Shao and Zhan (J Graph Theory 48:142–146, 2005) showed that every 3-connected N 2-locally connected claw-free graph is Hamiltonian. In this paper, we generalize this result and show that every 3-connected claw-free graph G such that every locally disconnected vertex lies on some induced cycle of length at least 4 with at most 4 edges contained in some triangle of G is Hamiltonian. It is best possible in some sense. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |