Abstract
Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise distance greater than i. We solve an open problem of Goddard et al. and show that the decision whether a tree allows a packing coloring with at most k classes is NP-complete.
We accompany this NP-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the lower bounds on the distances between vertices inside color classes are determined by an infinite nondecreasing sequence of bounded integers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
Borie, R.B.: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123–137 (1995)
Brešar, B., Klavžar, S., Rall, D.F.: On the packing chromatic number of cartesian products, hexagonal lattice, and trees. Discrete Applied Mathematics 155, 2303–2311 (2007)
Courcelle, B.: The monadic second-order logic of graphs iii: tree-decompositions, minor and complexity issues. RAIRO Informatique Théorique et Applications 26, 257–286 (1992)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33, 125–150 (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability.A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)
Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J.M., Rall, D.F.: Broadcast chromatic numbers of graphs. Ars Combinatoria 86, 33–49 (2008)
Kearney, P.E., Corneil, D.G.: Tree powers. Journal of Algorithms 29, 111–131 (1998)
Lin, Y.L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics 8, 99–118 (1995)
Rall, D.F., Finbow, A.: On the packing chromatic number of some infinite graphs. Discrete Applied Mathematics (to appear, 2007)
Sloper, C.: An eccentric coloring of trees. The Australasian Journal of Combinatorics 29, 309–321 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiala, J., Golovach, P.A. (2008). Complexity of the Packing Coloring Problem for Trees. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-92248-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92247-6
Online ISBN: 978-3-540-92248-3
eBook Packages: Computer ScienceComputer Science (R0)