Exact and Parameterized Algorithms for Choosability
Pages 111 - 124
Abstract
In the Choosability problem (or list chromatic number problem), for a given graph G, we need to find the smallest k such that G admits a list coloring for any list assignment where all lists contain at least k colors. The problem is tightly connected with the well-studied Coloring and List Coloring problems. However, the knowledge of the complexity landscape for the Choosability problem is pretty scarce. Moreover, most of the known results only provide lower bounds for its computational complexity and do not provide ways to cope with the intractability. The main objective of our paper is to construct the first non-trivial exact exponential algorithms for the Choosability problem, and complete the picture with parameterized results.
Specifically, we present the first single-exponential algorithm for the decision version of the problem with fixed k. This result answers an implicit question from Eppstein on a stackexchange thread discussing upper bounds on the union of lists assigned to vertices. We also present a time algorithm for the general Choosability problem.
In the parameterized setting, we give a polynomial kernel for the problem parameterized by vertex cover, and algorithms that run in FPT time when parameterized by clique-modulator and by the dual parameterization . Additionally, we show that Choosability admits a significant running time improvement if it is parameterized by cutwidth in comparison with the parameterization by treewidth studied by Marx and Mitsou [ICALP’16]. On the negative side, we provide a lower bound parameterized by a modulator to split graphs under assumption of the Exponential Time Hypothesis.
References
[1]
Alon N Restricted colorings of graphs Surv. Comb. 1993 187 1-33
[2]
Alon N and Tarsi M Colorings and orientations of graphs Combinatorica 1992 12 125-134
[3]
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11–13 June 2007, pp. 67–74. ACM (2007)
[4]
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 67–74 (2007)
[5]
Bliznets, I., Hecher, M.: Private communication (2023)
[6]
Bonamy M and Kang RJ List coloring with a bounded palette J. Graph Theory 2017 84 1 93-103
[7]
Cygan M et al. Parameterized Algorithms 2015 Cham Springer
[8]
Diestel R Graph Theory 2006 Heidelberg Springer
[9]
Erdos, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 26, pp. 125–157 (1979)
[10]
Fellows MR et al. On the complexity of some colorful problems parameterized by treewidth Inf. Comput. 2011 209 2 143-153
[11]
Fomin, F., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). Publisher Copyright: Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi 2019
[12]
Golovach PA and Heggernes P Královič R and Niwiński D Choosability of -free graphs Mathematical Foundations of Computer Science 2009 2009 Heidelberg Springer 382-391
[13]
Golovach, P.A., Heggernes, P.: Choosability of -free graphs. Bull. Syktyvkar Univ. Ser. 1. Math. Mech. Comput. Sci. (11), 126–139 (2010)
[14]
Golovach, P.A., Heggernes, P., van’t Hof, P., Paulusma, D.: Choosability on -free graphs. Inf. Process. Lett. 113(4), 107–110 (2013)
[15]
Gutner S The complexity of planar graph choosability Discrete Math. 1996 159 1–3 119-130
[16]
Gutner S and Tarsi M Some results on (a: b)-choosability Discrete Math. 2009 309 8 2260-2270
[17]
Jansen BM and Nederlof J Computing the chromatic number using graph decompositions via matrix rank Theor. Comput. Sci. 2019 795 520-539
[18]
Kowalik, L., Socala, A.: Tight lower bounds for list edge coloring. In: Eppstein, D. (ed.) 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. LIPIcs, Malmö, Sweden, 18–20 June 2018, vol. 101, pp. 28:1–28:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
[19]
Král’ D and Sgall J Coloring graphs from lists with bounded size of their union J. Graph Theory 2005 49 3 177-186
[20]
Marx, D., Mitsou, V.: Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth (2016)
[21]
Molloy M The list chromatic number of graphs with small clique number J. Comb. Theory Ser. B 2019 134 264-284
[22]
Noel JA, Reed BA, and Wu H A proof of a conjecture of Ohba J. Graph Theory 2015 79 2 86-102
[23]
Reed B and Sudakov B List colouring when the chromatic number is close to the order of the graph Combinatorica 2004 25 1 117-123
[24]
Vizing VG Coloring the vertices of a graph in prescribed colors Diskret. Analiz 1976 29 3 10
Recommendations
Bordeaux 3-color conjecture and 3-choosability
A graph G=(V,E) is list L-colorable if for a given list assignment L={L(v):v@?V}, there exists a proper coloring c of G such that c(v)@?L(v) for all v@?V. If G is list L-colorable for every list assignment with |L(v)|>=k for all v@?V, then G is said to ...
Acyclic 3-choosability of sparse graphs with girth at least 7
Every planar graph is known to be acyclically 7-choosable and is conjectured to be acyclically 5-choosable (Borodin et al. 2002 [4]). This conjecture if proved would imply both Borodin's acyclic 5-color theorem (1979) and Thomassen's 5-choosability ...
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
A graph is $k$-choosable if it can be colored whenever every vertex has a list of at least $k$ available colors. We prove that if a triangle-free planar graph is not 3-choosable, then it contains a 4-cycle that intersects another 4- or 5-cycle in ...
Comments
Information & Contributors
Information
Published In
Feb 2024
513 pages
ISBN:978-3-031-52112-6
DOI:10.1007/978-3-031-52113-3
- Editors:
- Henning Fernau,
- Serge Gaspers,
- Ralf Klasing
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 19 February 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Jan 2025