"The paper considers distance constrained labelings of graphs of bounded treewidth. In particular we prove that L(2,1) labeling is NP-hard for series-parallel graphs, i.e., graphs of treewidth two." . "13"^^ . . . . . . "RIV/00216208:11320/05:00206177!RIV10-MSM-11320___" . "Distance; constrained; labelings; graphs; bounded; treewidth"@en . "11320" . . . "3-540-27580-0" . "Distance constrained labelings of graphs of bounded treewidth" . . . . "Distance constrained labelings of graphs of bounded treewidth"@en . "2"^^ . "518305" . "[B098F85FBA96]" . . "Distance constrained labelings of graphs of bounded treewidth" . "Springer-Verlag" . . "RIV/00216208:11320/05:00206177" . "Kratochv\u00EDl, Jan" . "3"^^ . "Fiala, Ji\u0159\u00ED" . . "Golovach, Petr A." . . . "Berlin" . . "Berlin" . "Automata, Languages and Programming, proceedings" . . "Distance constrained labelings of graphs of bounded treewidth"@en . . . "2005-01-01+01:00"^^ . . . "P(1M0545), P(ME 525), Z(MSM0021620838)" . "The paper considers distance constrained labelings of graphs of bounded treewidth. In particular we prove that L(2,1) labeling is NP-hard for series-parallel graphs, i.e., graphs of treewidth two."@en . . . "000230880500030" .