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