Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleA Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.AuthorsGolovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, JianAbstractFor a positive integer k, a k- coloring of a graphSubjectsGRAPH coloring; SUBGRAPHS; GRAPH theory; INTEGERS; COMPUTATIONAL complexityPublicationJournal of Graph Theory, 2017, Vol 84, Issue 4, p331ISSN0364-9024Publication typeArticleDOI10.1002/jgt.22028