Skip to main content
Log in

Fixed-Parameter Tractability of (nk) List Coloring

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider the list-coloring problem from the perspective of parameterized complexity. In the classical graph coloring problem we are given an undirected graph and the goal is to color the vertices of the graph with minimum number of colors so that end points of each edge get different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored. An interesting parameterization for graph coloring that has been studied is whether the graph can be colored with nk colors, where k is the parameter and n is the number of vertices. This is known to be fixed parameter tractable. Our main result is that this can be generalized for list-coloring as well. More specifically, we show that, given a graph with each vertex having a list of size nk, it can be determined in \(f(k)n^{{\mathcal O}(1)}\) time, for some function f of k, whether there is a coloring that respects the lists.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. In the rest of the paper, we drop the index referring to the underlying graph if the reference is clear

References

  1. Banik, A., Jacob, A., Paliwal, V.K., Raman, V.: Fixed-parameter tractability of (nk) list coloring. In: International workshop on combinatorial algorithms, pp 61–69. Springer (2019)

  2. Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237–267 (1976). https://doi.org/10.1016/0304-3975(76)90059-1

    Article  MathSciNet  MATH  Google Scholar 

  3. Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discret. Math. 30(3), 289–293 (1980). https://doi.org/10.1016/0012-365X(80)90236-8

    Article  MathSciNet  MATH  Google Scholar 

  4. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms. Springer, Berlin (2015)

    MATH  Google Scholar 

  5. Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. Inf. Comput. 231, 70–88 (2013)

    MathSciNet  MATH  Google Scholar 

  6. Cai, L.: Parameterized complexity of vertex colouring. Discret. Appl. Math. 127(3), 415–429 (2003). https://doi.org/10.1016/S0166-218X(02)00242-1

    Article  MathSciNet  MATH  Google Scholar 

  7. Paulusma, D.: Open problems on graph coloring for special graph classes. In: Graph-theoretic concepts in computer science - 41st international workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, pp 16–30. https://doi.org/10.1007/978-3-662-53174-7_2 (2015)

  8. Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2), 143–153 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Chor, B., Fellows, M., Juedes, D.: Linear kernels in linear time, or how to save k colors in O(n2) steps. In: International workshop on graph-theoretic concepts in computer science, pp 257–269. Springer (2004)

  10. Arora, P., Banik, A., Paliwal, V.K., Raman, V.: Some (in) tractable parameterizations of coloring and list-coloring. In: International workshop on frontiers in algorithmics, pp 126–139. Springer (2018)

  11. Diestel, R.: Graph theory, 4th edition, Graduate texts in mathematics, vol. 173. Springer, Berlin (2012)

    Google Scholar 

  12. Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973). https://doi.org/10.1137/0202019

    Article  MathSciNet  MATH  Google Scholar 

  13. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Gutin, G., Majumdar, D., Ordyniak, S., Wahlström, M: Parameterized pre-coloring extension and list coloring problems. In: 37th International symposium on theoretical aspects of computer science (STACS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ashwin Jacob.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

Guest Editors: Charles Colbourn, Roberto Grossi, Nadia Pisanti

A preliminary version appeared in the proceedings of IWOCA 2019 [1]

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Banik, A., Jacob, A., Paliwal, V.K. et al. Fixed-Parameter Tractability of (nk) List Coloring. Theory Comput Syst 64, 1307–1316 (2020). https://doi.org/10.1007/s00224-020-10014-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-020-10014-9

Keywords

Navigation