Coloring Bull-Free Perfectly Contractile Graphs

11 years 11 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every graph in this class. This algorithm is based on the existence in every such graph of an ordering of the vertices with a special property. More generally we prove, using a variant of lexicographic breadth-first search, that in every graph that contains no bull and no hole of length at least five there is a vertex that is not the middle of a chordless path on five vertices. This latter fact also generalizes known results about chordal bipartite graphs, totally balanced matrices, and strongly chordal graphs. Key words. perfect graph, bull-free graph, coloring, LexBFS AMS subject classifications. 05C15, 05C17, 05C85 DOI. 10.1137/06065948X
Benjamin Lévêque, Frédé
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Authors Benjamin Lévêque, Frédéric Maffray
Comments (0)