Robert Janczewski, Adrian Kosowski, Michal Malafiejski. The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discrete Mathematics, 309(10):3270-3279, 2009. [doi]
@article{JanczewskiKM09,
title = {The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree},
author = {Robert Janczewski and Adrian Kosowski and Michal Malafiejski},
year = {2009},
doi = {10.1016/j.disc.2008.09.028},
url = {http://dx.doi.org/10.1016/j.disc.2008.09.028},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/JanczewskiKM09},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {309},
number = {10},
pages = {3270-3279},
}