Atlas home || Conferences | Abstracts | about Atlas

22nd Cumberland Conference on Combinatorics, Graph Theory and Computing
May 21-23, 2009
Western Kentucky University
Bowling Green, KY, USA

Organizers
Bela Csaba, Chair; Mustafa Atici; Robert Crawford; Claus Ernst; Dominic Lanphier; Attila Por

View Abstracts
Conference Homepage

Forbidden pairs and 3-connected pancyclic graphs
by
Ronald Gould
Emory University
Coauthors: T. Luczak and F. Pfender

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.

Date received: April 30, 2009

Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-52.