点击次数：

论文类型：期刊论文

发表时间：2013-05-01

发表刊物：GRAPHS AND COMBINATORICS

收录刊物：SCIE、Scopus

卷号：29

期号：3

页面范围：599-608

ISSN号：0911-0119

关键字：Connected even factor; Cycle; Claw-free graph; Tank-ring factor

摘要：A graph G has a tank-ring factor F if F is a connected spanning subgraph with all vertices of degree 2 or 4 that consists of one cycle C and disjoint triangles attaching to exactly one vertex of C such that every component of G - C contains exactly two vertices. In this paper, we show the following results. (1) Every supereulerian claw-free graph G with 1-hourglass property contains a tank-ring factor. (2) Every supereulerian claw-free graph with 2-hourglass property is Hamiltonian.