Skip to content

Computational complexity of distance edge labeling

Citations of this article
Mendeley users who have this article in their library.
Get full text


The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as L2,1labeling) that has been studied for more than twenty years and has many applications, such as frequency assignment. The Distance Edge Labeling problem asks whether the edges of a given graph can be labeled such that the labels of adjacent edges differ by at least two and the labels of edges at distance two differ by at least one. Labels are chosen from the set {0, 1,...,λ} for λ fixed. We present a full classification of its computational complexity—a dichotomy between the polynomially solvable cases and the remaining cases which are NP-complete. We characterise graphs with λ ≤ 4 which leads to a polynomial-time algorithm recognizing the class and we show NP-completeness for λ ≥ 5 by several reductions from Monotone Not All Equal 3-SAT.




Knop, D., & Masařík, T. (2016). Computational complexity of distance edge labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9538, pp. 287–298). Springer Verlag.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free