Tank-ring factors in supereulerian claw-free graphs

MingChu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma

Research output: Contribution to journalArticleAcademicpeer-review


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.
Original languageUndefined
Pages (from-to)599-608
Number of pages10
JournalGraphs and combinatorics
Issue number3
Publication statusPublished - 2013


  • MSC-05C
  • EWI-23369
  • Claw-free graph
  • IR-86130
  • Hourglass property
  • METIS-297653
  • Hamiltonian graph

Cite this