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

Broersma, H.J.

Fomin, F.V.

Kratochvil, J.

Woeginger, G.J.

CiteSeerX

University of Twente Research Information

English

A generalization of the chromatic number,

A note on defective colorings of graphs in surfaces,

Acyclic colorings of planar graphs,

B-sets and planar graphs,

Conditional colorability in graphs, in Graphs and applications

Decomposing a planar graph into degenerate graphs,

Defective coloring revisited,

Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency,

Extremal results on defective colorings of graphs,

Finite graphs (Investigations and generalizations concerning the construction of  graphs having given chromatic number and no triangles).,

G k-colorable graphs,

Generalized colorings of outer-planar and planar graphs, in Graph theory with applications to algorithms and computer science

Graph subcoloring: Complexity and algorithms,

More about subcolorings,

Ne set ril, Partitions of graphs into cographs,

On generalized graph colorings,

On the linear vertex-arboricity of a planar graph,

P4-free colorings and P4-bipartite graphs,

The bi-colorability of planar hypergraphs,

The complexity of G-free colorability,

The complexity of induced minors and related problems,

The NP-completeness of (1;r)-subcoloring of cubic graphs,

The planar Hamiltonian problem is NP-complete,

The point-arboricity of a graph,

The point-arboricity of planar graphs,

The subchromatic number of a graph,

Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult