The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree

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]

Authors

Robert Janczewski

This author has not been identified. Look up 'Robert Janczewski' in Google

Adrian Kosowski

This author has not been identified. Look up 'Adrian Kosowski' in Google

Michal Malafiejski

This author has not been identified. Look up 'Michal Malafiejski' in Google