Critical graphs for subpancyclicity of 3‐connected claw‐free graphs
Ronald J. Gould, Tomasz Łuczak, Florian Pfender · Journal of Graph Theory · 2009
Abstract Let ${\cal{F}}_{k}$ be the family of graphs G such that all sufficiently large k ‐connected claw‐free graphs which contain no induced copies of G are subpancyclic. We show that for every k≥3 the family ${\cal{F}}_{1}k$ is infinite and make the first step toward the complete characterization of the family ${\cal{F}}_{3}$ . © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 263–278, 2009