A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Publication status||Published - 2002|
|Publisher||Department of Applied Mathematics, University of Twente|