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]
@article{GolovachJPS17,
title = {A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs},
author = {Petr A. Golovach and Matthew Johnson 0002 and Daniël Paulusma and Jian Song},
year = {2017},
doi = {10.1002/jgt.22028},
url = {http://dx.doi.org/10.1002/jgt.22028},
researchr = {https://researchr.org/publication/GolovachJPS17},
cites = {0},
citedby = {0},
journal = {Journal of Graph Theory},
volume = {84},
number = {4},
pages = {331-363},
}