Abstract
An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, . . . , λ} to the nodes of the graph such that adjacent nodes are assigned integers of at least distance h ≥ 1 apart and all nodes of distance three or less must be assigned different labels. The aim of the L(h, 1, 1)-labeling problem is to minimize λ, denoted by λ h, 1, 1 and called span of the L(h, 1, 1)-labeling. As outerplanar graphs have bounded treewidth, the L(1, 1, 1)-labeling problem on outerplanar graphs can be exactly solved in O(n 3), but the multiplicative factor depends on the maximum degree Δ and is too big to be of practical use. In this paper we give a linear time approximation algorithm for computing the more general L(h, 1, 1)-labeling for outerplanar graphs that is within additive constants of the optimum values.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agnarsson G, Halldórsson M (2004) On coloring of squares of outerplanar graphs. In: Proceedings of 15th annual ACM-SIAM symposium on discrete algorithms (SODA 2004), pp 242–253
Bodlaender HL, Kloks T, Tan RB, van Leeuwen J (2004) Approximations for λ-colorings of graphs. Comput J 47:193–204. Preliminary version in Proceedings of 17th annual symposium on theoretical aspects of computer science (STACS 2000). Lectures notes in computer science, vol 1770, pp 395–406, 2000
Bruce RJ, Hoffmann M (2003) L(p, q)-labeling of outerplanar graphs. Technical report no. 2003/9, Department of Mathematics and Computer Science, University of Leicester, England
Calamoneri T (2006) The L(h, k)-labelling problem: a survey and annotated bibliography. Comput J 49-5:585–608 (a continuously updated version is available online at http://www.dsi.uniroma1.it/~calamo/survey.html)
Calamoneri T, Petreschi R (2004) L(h, 1)-labeling subclasses of planar graphs. J Parallel Distrib Comput 64(3): 414–426
Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance 2. SIAM J Disc Math 5: 586–595
Jonas K (1993) Graph coloring analogues with a condition at distance two: L(2, 1)-labelings and list λ-labelings. Ph.D. thesis, University of South Carolina, Columbia
McCormick ST (1983) Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math Program 26: 153–171
Ramanathan S, Lloyd EL (1992) The complexity of distance-2-coloring. In: Proceedings of fourth international conference of computing and information (ICCI ’92), pp 71–74
Report of the project critical resource sharing for cooperation in complex systems (Crescco) funded by the European Community under the “Information Society Technologies” Programme (1998–2002), Technical Report IST-2001-33135
Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math 306(2): 1217–1231
Zhou X, Kanari Y, Nishizeki T (2000) Generalized vertex-coloring of partial k-trees. IEICE Trans Fundam Electr Commun Comput Sci E83-A: 671–678
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is partially supported by the European Research Project Algorithmic Principles for Building Efficient Overlay Computers (AEOLUS) and was done during the visit of Richard B. Tan at the Department of Computer Science, University of Rome “Sapienza”, supported by a visiting fellowship from the University of Rome “Sapienza”.
Rights and permissions
About this article
Cite this article
Calamoneri, T., Fusco, E.G., Tan, R.B. et al. L(h, 1, 1)-labeling of outerplanar graphs. Math Meth Oper Res 69, 307–321 (2009). https://doi.org/10.1007/s00186-008-0261-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-008-0261-6