Sciweavers

ENDM
2006
96views more  ENDM 2006»
13 years 4 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...