Pancyclicity of 4-connected claw-free bull-free graphs

Hong Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou

Research output: Contribution to journalArticlepeer-review


AgraphG is said to be pancyclic if G contains cycles of lengths from 3to|V (G)|. The bull B(i, j) is obtained by associating one endpoint of each of the path Pi+1 and Pj+1 with distinct vertices of a triangle. In [M. Ferrara et al., Discrete Math. 313 (2013), 460–467], it was shown that every 4-connected {K1,3,B(i, j)}-free graph with i + j = 6 is pancyclic. In this paper we show that every 4-connected {K1,3,B(i, j)}-free graph with i + j = 7 is either pancyclic or it is the line graph of the Petersen graph.

Original languageEnglish (US)
Pages (from-to)366-386
Number of pages21
JournalAustralasian Journal of Combinatorics
Issue number3
StatePublished - 2020

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Pancyclicity of 4-connected claw-free bull-free graphs'. Together they form a unique fingerprint.

Cite this