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

DOI10.1007/978-3-642-13562-0_20zbMath1284.05237OpenAlexW1588960957MaRDI QIDQ3569077

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

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_20

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees, Distance three labelings of trees