Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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 PublicationsThe following publications are possibly variants of this publication: Coloring Graphs Characterized by a Forbidden SubgraphPetr A. Golovach, Daniël Paulusma, Bernard Ries. mfcs 2012: 443-454 [doi] Coloring graphs characterized by a forbidden subgraphPetr A. Golovach, Daniël Paulusma, Bernard Ries. DAM, 180:101-110, 2015. [doi]
The following publications are possibly variants of this publication: