Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Decomposition of graphical sequences and unigraphs
Discrete Mathematics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Fixed-Parameter Complexity of lambda-Labelings
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
L(h,1)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Discrete Applied Mathematics
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
| Hi-index | 0.04 |
The L(2,1)-labeling problem consists of assigning colors from the integer set 0,...,@l to the nodes of a graph G in such a way that nodes at a distance of at most two get different colors, while adjacent nodes get colors which are at least two apart. The aim of this problem is to minimize @l and it is in general NP-complete. In this paper the problem of L(2,1)-labeling unigraphs, i.e. graphs uniquely determined by their own degree sequence up to isomorphism, is addressed and a 3/2-approximate algorithm for L(2,1)-labeling unigraphs is designed. This algorithm runs in O(n) time, improving the time of the algorithm based on the greedy technique, requiring O(m) time, that may be near to @Q(n^2) for unigraphs.