The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
On L(d, 1)-labelings of graphs
Discrete Mathematics
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distance Constrained Labeling of Precolored Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Channel Assignment on Strongly-Simplicial Graphs
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distance three labelings of trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
An L(p1,p2,p3)-labeling of a graph G with span λ is a mapping f that assigns each vertex u of G an integer label 0≤f(u)≤λ such that |f(u)−f(v)|≥pi whenever vertices u and v are of distance i for i∈{1,2,3} We show that testing whether a given graph has an L(2,1,1)-labeling with some given span λ is NP-complete even for the class of trees.