Van Bang Le, Bert Randerath, Ingo Schiermeyer. On the complexity of 4-coloring graphs without long induced paths. Theoretical Computer Science, 389(1-2):330-335, 2007. [doi]
@article{LeRS07,
title = {On the complexity of 4-coloring graphs without long induced paths},
author = {Van Bang Le and Bert Randerath and Ingo Schiermeyer},
year = {2007},
doi = {10.1016/j.tcs.2007.09.009},
url = {http://dx.doi.org/10.1016/j.tcs.2007.09.009},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LeRS07},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {389},
number = {1-2},
pages = {330-335},
}