A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

Petr A. Golovach, Matthew Johnson 0002, Daniël Paulusma, Jian Song. A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of Graph Theory, 84(4):331-363, 2017. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: