David Schindl. Some new hereditary classes where graph coloring remains NP-hard. Discrete Mathematics, 295(1-3):197-202, 2005. [doi]
@article{Schindl05,
title = {Some new hereditary classes where graph coloring remains NP-hard},
author = {David Schindl},
year = {2005},
doi = {10.1016/j.disc.2005.03.003},
url = {http://dx.doi.org/10.1016/j.disc.2005.03.003},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Schindl05},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {295},
number = {1-3},
pages = {197-202},
}