Sciweavers

Share
2 search results - page 1 / 1
» Coloring Bull-Free Perfectly Contractile Graphs
Sort
View
SIAMDM
2008
143views more  SIAMDM 2008»
12 years 1 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é...
GC
2007
Springer
12 years 1 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in ļ¬nding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
books