共 50 条
On Hamiltonicity of 3-Connected Claw-Free Graphs
被引:1
|作者:
Tian, Runli
[1
]
Xiong, Liming
[1
,2
]
Niu, Zhaohong
[3
]
机构:
[1] Beijing Inst Technol, Sch Math, Beijing 100081, Peoples R China
[2] Qinghai Univ Nationalities, Dept Math, Xining 810000, Peoples R China
[3] Shanxi Univ, Sch Math Sci, Taiyuan 030006, Peoples R China
基金:
北京市自然科学基金;
关键词:
Claw-free graph;
Hamiltonicity;
Locally disconnected vertex;
Singular edge;
Singular k-cycle (property);
D O I:
10.1007/s00373-013-1343-7
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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.
引用
收藏
页码:1261 / 1269
页数:9
相关论文