"On the Computational Complexity of the L(2, 1)-Labeling ..."

Jirí Fiala, Jan Kratochvíl (2005)

> Home

Details and statistics

DOI: 10.1007/11560586_19

access: closed

type: Conference or Workshop Paper

metadata version: 2017-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ictcs/FialaK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictcs/FialaK05
Jirí Fiala, Jan Kratochvíl:
On the Computational Complexity of the L_{(2, 1)}-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236

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.