Distance Constrained Labelings of Trees
DOI10.1007/978-3-540-79228-4_11zbMath1139.05341OpenAlexW1494911173MaRDI QIDQ3502639
Petr A. Golovach, Jan Kratochvíl, Jiří Fiala
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_11
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) 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 (1)
Cites Work
- On \(L(d,1)\)-labelings of graphs
- Systems of distant representatives
- Cyclic labellings with constraints at two distances
- A survey on labeling graphs with a condition at distance two
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Labelling Graphs with a Condition at Distance 2
- Partial covers of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Automata, Languages and Programming
- Fixed-parameter complexity of \(\lambda\)-labelings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distance Constrained Labelings of Trees
