Sciweavers

SIAMDM
2008
143views more  SIAMDM 2008»
13 years 10 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 g...
Benjamin Lévêque, Frédé...
JCT
2006
79views more  JCT 2006»
13 years 10 months ago
A class of perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
Frédéric Maffray, Nicolas Trotignon