Contract grant sponsor: NSF; Contract grant numbers: DMS-0758364; DMS-1001091 (to M. C.).
The Structure of Bull-Free Perfect Graphs
Version of Record online: 8 AUG 2012
© 2012 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 74, Issue 1, pages 1–31, September 2013
How to Cite
Chudnovsky, M. and Penev, I. (2013), The Structure of Bull-Free Perfect Graphs. J. Graph Theory, 74: 1–31. doi: 10.1002/jgt.21688
- Issue online: 3 JUL 2013
- Version of Record online: 8 AUG 2012
- Manuscript Revised: 18 MAY 2012
- Manuscript Received: 6 FEB 2011
- NSF. Grant Numbers: DMS-0758364, DMS-1001091
- bull-free graphs;
- perfect graphs;
- structure theorem
The bull is a graph consisting of a triangle and two vertex-disjoint pendant edges. A graph is called bull-free if no induced subgraph of it is a bull. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H equals the size of the largest complete subgraph of H. This article describes the structure of all bull-free perfect graphs.