Andreas Brandstädt, Van Bang Le, Thomas Szymczak. The Complexity of some Problems Related to Graph 3-colorability. Discrete Applied Mathematics, 89(1-3):59-73, 1998. [doi]
@article{BrandstadtLS98,
title = {The Complexity of some Problems Related to Graph 3-colorability},
author = {Andreas Brandstädt and Van Bang Le and Thomas Szymczak},
year = {1998},
doi = {10.1016/S0166-218X(98)00116-4},
url = {http://dx.doi.org/10.1016/S0166-218X(98)00116-4},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BrandstadtLS98},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {89},
number = {1-3},
pages = {59-73},
}