@book{a5e3d4ed4afd481ca5ed6cdfc4d56042,

title = "Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult",

abstract = "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.",

keywords = "MSC-05C85, MSC-05C15, IR-65886, EWI-3521, MSC-05C17",

author = "Broersma, {Haitze J.} and F.V. Fomin and J. Kratochvil and Gerhard Woeginger",

note = "Imported from MEMORANDA",

year = "2003",

language = "English",

series = "Memorandum Afdeling TW",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1701",

}