期刊论文

Lin HouYuan

英文

中国科学：数学英文版

1674-7283

2013

56

8

1585-1595

10.1007/s11425-013-4631-z

Acknowledgements This work was supported by National Natural Science Foundation of China （Grant Nos. 11071096 and 11271149）, Hubei Provincial Department of Education （Grant No. D20111110）, and Jinan Science and Technology Bureau （Grant No. 20110205）. The authors would like to thank the referees for their valuable suggestions and comments.

本校为其他机构

For non-negative integers i, j and k, let N i,j,k be the graph obtained by identifying end vertices of three disjoint paths of lengths i, j and k to the vertices of a triangle. In this paper, we prove that every 3-connected {K 1,3,N 3,3,3}-free graph is Hamiltonian. This result is sharp in the sense that for any integer i > 3, there exist infinitely many 3-connected {K 1,3,N i,3,3}-free non-Hamiltonian graphs.

为非否定的整数 i， j 和 k，让 N i， j， k 图被鉴别三的结束顶点拆散获得到一个三角形的顶点的长度 i， j 和 k 的路径。在这份报纸，我们证明那是每 3-connected { K 1,3， N 3,3,3 } 免费的图是 Hamiltonian。这结果在意义是锋利的为任何整数 i > 3，在那里无穷地存在许多 3-connected { K 1,3， N i， 3,3 } 免费 non-Hamiltonian 图。