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

Robert Janczewski, Adrian Kosowski, Michal Malafiejski (2009)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2008.09.028

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/JanczewskiKM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/JanczewskiKM09
Robert Janczewski, Adrian Kosowski, Michal Malafiejski:
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309(10): 3270-3279 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.