We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Publication status||Published - 2003|
|Name||Memorandum Afdeling TW|
|Publisher||Department of Applied Mathematics, University of Twente|