2 search results - page 1 / 1 » Coloring Bull-Free Perfectly Contractile Graphs |
SIAMDM
2008
13 years 10 months ago
2008
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...
GC
2007
Springer
13 years 10 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...