Distance constrained labelings of graphs of bounded treewidth
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F05%3A00206177" target="_blank" >RIV/00216208:11320/05:00206177 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Distance constrained labelings of graphs of bounded treewidth
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Automata, Languages and Programming, proceedings
ISBN
3-540-27580-0
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2005
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000230880500030