Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4."

Nicole Eggemann, Frédéric Havet, Steven D. Noble (2010)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2010.06.016

access: open

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/EggemannHN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/EggemannHN10
Nicole Eggemann, Frédéric Havet, Steven D. Noble:
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Discret. Appl. Math. 158(16): 1777-1788 (2010)

a service of

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.