Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2013-05-01

Journal: GRAPHS AND COMBINATORICS

Included Journals: Scopus、SCIE

Volume: 29

Issue: 3

Page Number: 599-608

ISSN: 0911-0119

Key Words: Connected even factor; Cycle; Claw-free graph; Tank-ring factor

Abstract: 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.