Carl Johan Casselgren. Vertex coloring complete multipartite graphs from random lists of size 2. Discrete Mathematics, 311(13):1150-1157, 2011. [doi]
@article{Casselgren11,
title = {Vertex coloring complete multipartite graphs from random lists of size 2},
author = {Carl Johan Casselgren},
year = {2011},
doi = {10.1016/j.disc.2010.07.013},
url = {http://dx.doi.org/10.1016/j.disc.2010.07.013},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Casselgren11},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {311},
number = {13},
pages = {1150-1157},
}