André Große, Jörg Rothe, Gerd Wechsung. On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett., 99(6):215-221, 2006. [doi]
@article{GrosseRW06,
title = {On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P},
author = {André Große and Jörg Rothe and Gerd Wechsung},
year = {2006},
doi = {10.1016/j.ipl.2006.04.007},
url = {http://dx.doi.org/10.1016/j.ipl.2006.04.007},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GrosseRW06},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {215-221},
}