Pancyclicity in claw-free graphs

In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with minimum degree sum 2 > 2 3n + 1 - 4; every {K1,3, P7}-free graph with 2 9; every {K1,3, Z4}-free graph with 2 9; and every K1,3-free graph with maximum degree , diam(G) < +6 4 and 2 9 is subpancyclic. Key words: claw-free, pancyclicity, forbidden subgraphs

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Ronald J. Gould, Florian Pfender
• Keywords: -free Graph, 3-free Graph, DM 2002, Minimum Degree Sum