Pancyclicity of 3‐connected graphs: Pairs of forbidden subgraphs
Ronald J. Gould, Tomasz Łuczak, Florian Pfender · Journal of Graph Theory · 2004
Abstract We characterize all pairs of connected graphs {X, Y} such that each 3‐connected {X, Y}‐free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X, Y} has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 183–202, 2004