More about subcolorings

Share/Save/Bookmark

Broersma, H.J. and Fomin, F.V. and Nešetřil, J. and Woeginger, G.J. (2002) More about subcolorings. [Report]

open access
[img]
Preview
PDF
343kB
Abstract:
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.
Item Type:Report
Additional information:Imported from MEMORANDA
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65822
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page