Every 3-connected {K1,3, N3,3,3}-free graph is Hamiltonian

For non-negative integers i,j and k, let Ni,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 {K1,3, N3,3,3}-free graph is Hamiltonian. This result is sharp in the sense tha...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Mathematics 2013-08, Vol.56 (8), p.1585-1595
Main Authors: Lin, HouYuan, Hu, ZhiQuan
Format: Article
Language:English
Subjects:
Applications of Mathematics
China
Graphs
Hamilton图
igt
Integers
Mathematical analysis
Mathematics
Mathematics and Statistics
Triangles
三角形
不相交
吞吐量
哈密顿
无穷多
非负整数
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For non-negative integers i,j and k, let Ni,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 {K1,3, N3,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 {K1,3, Ni,3,3）-free non-Hamiltonian graphs.
ISSN:1674-7283
1869-1862
DOI:10.1007/s11425-013-4631-z