"L(2, 1, 1)-Labeling Is NP-Complete for Trees."

Petr A. Golovach, Bernard Lidický, Daniël Paulusma (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-13562-0_20

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/GolovachLP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/GolovachLP10
Petr A. Golovach, Bernard Lidický, Daniël Paulusma:
L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221

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.