Abstract
The L(2,1)-labeling problem consists of assigning colors from the integer set 0, ...,λ 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 λ 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 Θ(n 2) for unigraphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Araki, T.: Labeling bipartite permutation graphs with a condition at distance two. Discrete Applied Mathematics 157(8), 1677–1686 (2009)
Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: λ-Coloring of Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 395–406. Springer, Heidelberg (2000)
Borri, A., Calamoneri, T., Petreschi, R.: Recognition of Unigraphs through Superposition of Graphs. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 165–176. Springer, Heidelberg (2009)
Calamoneri, T., Caminiti, S., Olariu, S., Petreschi, R.: On the L(h,k)-labeling Co-Comparability graphs and Circular-Arc graphs. Networks 53(1), 27–34 (2009)
Calamoneri, T.: The L(h,k)-Labelling Problem: A Survey and Annotated Bibliography. The Computer Journal 49(5), 585–608 (2006)
Calamoneri, T., Petreschi, R.: Lambda-Coloring Matrogenic Graphs. Discrete Applied Mathematics 154, 2445–2457 (2006)
Calamoneri, T., Petreschi, R.: L(h,1)-Labeling Subclasses of Planar Graphs. Journal on Parallel and Distributed Computing 64(3), 414–426 (2004)
Cerioli, M., Posner, D.: On L(2,1)-coloring P 4 tidy graphs. In: 8th French Combinatorial Conference (2010)
Chang, G.J., Kuo, D.: The L(2,1)-labeling Problem on Graphs. SIAM J. Disc. Math. 9, 309–316 (1996)
Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-parameter Complexity of λ-Labelings. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 350–363. Springer, Heidelberg (1999)
Griggs, J.R., Yeh, R.K.: Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math. 5, 586–595 (1992)
Li, S.Y.: Graphic sequences with unique realization. Journal Comb. Theory, B 19(1), 42–68 (1975)
Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math. 56 (1995)
Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math. 7, 133–140 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calamoneri, T., Petreschi, R. (2011). L(2,1)-Labeling of Unigraphs. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)