Abstract
Given a graph G, the graph G l has the same vertex set and two vertices are adjacent in G l if and only if they are at distance at most l in G. The l-coloring problem consists in finding an optimal vertex coloring of the graph G l, where G the input graph. We show that, for any fixed value of l, the l-coloring problem is polynomial when restricted to graphs of bounded clique-width, if an expression of the graph is also part of the input.
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
Bodlaender, H., Kratsch, D.: Private communication (2002)
Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117–128. Springer, Heidelberg (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completness. Freeman, New York (1979)
Grigs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. on Discrete Math. 5, 586–595 (1992)
Kobler, D., Rotics, U.: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA 2001), pp. 468–476 (2001)
Todinca, I.: Coloring powers of graphs of bounded clique-width. Research Report RR-2002-10, LIFO – Université d’Orléans (2002), http://www.univorleans.fr/SCIENCES/LIFO/prodsci/rapports/RR/RR2002/RR-2002-10.ps.gz
Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-colorings for partial k-trees. IEICE Trans. Fundamentals E83-A(4), 671–677 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Todinca, I. (2003). Coloring Powers of Graphs of Bounded Clique-Width. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-39890-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20452-7
Online ISBN: 978-3-540-39890-5
eBook Packages: Springer Book Archive