A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on 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
A Theorem about the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
Graph labeling and radio channel assignment
Journal of Graph Theory
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
Bounds for the L(d, 1): number of diameter 2 graphs, trees and cacti
International Journal of Mobile Network Design and Innovation
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
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
An O(n1.75) algorithm for L(2,1)-labeling of trees
Theoretical Computer Science
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
k-L(2,1)-labelling for planar graphs is NP-complete for k≥4
Discrete Applied Mathematics
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Fast exact algorithm for L(2, 1)-labeling of graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees
Discrete Applied Mathematics
Exact algorithms for L(2, 1)-labeling of graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Determining the l(2,1)-span in polynomial space
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Determining the L(2,1)-span in polynomial space
Discrete Applied Mathematics
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We prove that the L(2,1)-labeling problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one from treewidth two. We prove similar results for other variants of the distance constrained graph labeling problem.