Abstract
The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of Grundy Coloring, the problem of determining whether a given graph has Grundy number at least k. We show that Grundy Coloring can be solved in time \(O^*(2.443^n)\) on graphs of order n. While the problem is known to be solvable in time \(f(k,w)\cdot n\) for graphs of treewidth w, we prove that under the Exponential Time Hypothesis, it cannot be computed in time \(O^*(c^{w})\), for any constant c. We also study the parameterized complexity of Grundy Coloring parameterized by the number of colors, showing that it is in \(\mathsf {FPT}\) for graphs including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Finally, we consider two previously studied variants of Grundy Coloring, namely Weak Grundy Coloring and Connected Grundy Coloring. We show that Weak Grundy Coloring is fixed-parameter tractable with respect to the weak Grundy number. In stark contrast, it turns out that checking whether a given graph has connected Grundy number at least k is \(\mathsf {NP}\)-complete already for \(k=7\).
F. Foucaud—This research was done while this author was a postdoctoral fellow at the Department of Mathematics of University of Johannesburg (South Africa) and at LAMSADE.
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
Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42(4), 844–856 (1995)
Araujo, J., Sales, C.L.: On the Grundy number of graphs with few P\(_{\text{4 }}\)’s. Discrete Applied Mathematics 160(18), 2514–2522 (2012)
Benevides, F., Campos, V., Dourado, M., Griffiths, S., Morris, R., Sampaio, L., Silva, A.: Connected greedy colourings. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 433–441. Springer, Heidelberg (2014)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proc. 39th Annual ACM Symposium on Theory of Computing, STOC 2007, pp. 67–74. ACM (2007)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11(1–2), 1–21 (1993)
Bonnet, E., Foucaud, F., Kim, E.J., Sikora, F.: Complexity of grundy coloring and its variants (2014). CoRR, abs/1407.5336
Chang, G.J., Hsu, H.-C.: First-fit chromatic numbers of \(d\)-degenerate graphs. Discrete Mathematics 312(12–13), 2088–2090 (2012)
Christen, C.A., Selkow, S.M.: Some perfect coloring properties of graphs. Journal of Combinatorial Theory, Series B 27(1), 49–59 (1979)
Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model-checking. SIAM Journal on Computing 31(1), 113–145 (2001)
Goyal, N., Vishwanathan, S.: NP-completeness of undirected Grundy numbering and related problems. Manuscript (1997)
Grundy, P.M.: Mathematics and games. Eureka 2, 6–8 (1939)
Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory 12(2), 217–227 (1988)
Havet, F., Maia, A.K., Yu, M.-L.: Complexity of greedy edge-colouring. Research report RR-8171, INRIA, December 2012
Havet, F., Sampaio, L.: On the Grundy and b-chromatic numbers of a graph. Algorithmica 65(4), 885–899 (2013)
Hedetniemi, S.M., Hedetniemi, S.T., Beyer, T.: A linear algorithm for the Grundy (coloring) number of a tree. Congressus Numerantium 36, 351–363 (1982)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63(4), 512–530 (2001)
Kierstead, H.A., Saoub, K.R.: First-fit coloring of bounded tolerance graphs. Discrete Applied Mathematics 159(7), 605–611 (2011)
Kortsarz, G.: A lower bound for approximating Grundy numbering. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)
Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. In: Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 777–789. SIAM (2011)
Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3(1), 23–28 (1965)
Narayanaswamy, N.S., Babu, R.S.: A note on first-fit coloring of interval graphs. Order 25(1), 49–53 (2008)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)
Sampaio, L.: Algorithmic aspects of graph colouring heuristics. PhD thesis, University of Nice-Sophia Antipolis, November 2012
Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10(4), 529–550 (1997)
Zaker, M.: The Grundy chromatic number of the complement of bipartite graphs. Australasian Journal of Combinatorics 31, 325–329 (2005)
Zaker, M.: Results on the Grundy chromatic number of graphs. Discrete Mathematics 306(23), 3166–3173 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bonnet, É., Foucaud, F., Kim, E.J., Sikora, F. (2015). Complexity of Grundy Coloring and Its Variants. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)