A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Petr A. Golovach' in GoogleThis author has not been identified. Look up 'Matthew Johnson 0002' in GoogleThis author has not been identified. Look up 'Daniël Paulusma' in GoogleThis author has not been identified. Look up 'Jian Song' in Google

runs on WebDSL