Login / Signup
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.
Robert Janczewski
Adrian Kosowski
Michal Malafiejski
Published in:
Discret. Math. (2009)
Keyphrases
</>
planar graphs
bipartite graph
graph model
computational complexity
higher order