Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song. Narrowing Down the Gap on the Complexity of Coloring ::::P::::::::::k::::::-Free Graphs. In Dimitrios M. Thilikos, editor, Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. Volume 6410 of Lecture Notes in Computer Science, pages 63-74, 2010. [doi]
@inproceedings{BroersmaGPS10-0,
title = {Narrowing Down the Gap on the Complexity of Coloring ::::P::::::::::k::::::-Free Graphs},
author = {Hajo Broersma and Petr A. Golovach and Daniël Paulusma and Jian Song},
year = {2010},
doi = {10.1007/978-3-642-16926-7_8},
url = {http://dx.doi.org/10.1007/978-3-642-16926-7_8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaGPS10-0},
cites = {0},
citedby = {0},
pages = {63-74},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers},
editor = {Dimitrios M. Thilikos},
volume = {6410},
series = {Lecture Notes in Computer Science},
isbn = {978-3-642-16925-0},
}