Cite
HARVARD Citation
Golovach, P. et al. (2017). A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of graph theory. 84 (4), pp. 331-363. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Golovach, P. et al. (2017). A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of graph theory. 84 (4), pp. 331-363. [Online].