Digraph Coloring and Distance to Acyclicity

Authors Ararat Harutyunyan, Michael Lampis , Nikolaos Melissinos

Thumbnail PDF


  • Filesize: 0.74 MB
  • 15 pages

Document Identifiers

Author Details

Ararat Harutyunyan
  • Université Paris-Dauphine, PSL Research University, CNRS, UMR 7243, LAMSADE, Paris, France
Michael Lampis
  • Université Paris-Dauphine, PSL Research University, CNRS, UMR 7243, LAMSADE, Paris, France
Nikolaos Melissinos
  • Université Paris-Dauphine, PSL Research University, CNRS, UMR 7243, LAMSADE, Paris, France

Cite AsGet BibTex

Ararat Harutyunyan, Michael Lampis, and Nikolaos Melissinos. Digraph Coloring and Distance to Acyclicity. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 41:1-41:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


In k-Digraph Coloring we are given a digraph and are asked to partition its vertices into at most k sets, so that each set induces a DAG. This well-known problem is NP-hard, as it generalizes (undirected) k-Coloring, but becomes trivial if the input digraph is acyclic. This poses the natural parameterized complexity question of what happens when the input is "almost" acyclic. In this paper we study this question using parameters that measure the input’s distance to acyclicity in either the directed or the undirected sense. In the directed sense perhaps the most natural notion of distance to acyclicity is directed feedback vertex set (DFVS). It is already known that, for all k ≥ 2, k-Digraph Coloring is NP-hard on digraphs of DFVS at most k+4. We strengthen this result to show that, for all k ≥ 2, k-Digraph Coloring is already NP-hard for DFVS exactly k. This immediately provides a dichotomy, as k-Digraph Coloring is trivial if DFVS is at most k-1. Refining our reduction we obtain two further consequences: (i) for all k ≥ 2, k-Digraph Coloring is NP-hard for graphs of feedback arc set (FAS) at most k²; interestingly, this leads to a second dichotomy, as we show that the problem is FPT by k if FAS is at most k²-1; (ii) k-Digraph Coloring is NP-hard for graphs of DFVS k, even if the maximum degree Δ is at most 4k-1; we show that this is also almost tight, as the problem becomes FPT for DFVS k and Δ ≤ 4k-3. Since these results imply that the problem is also NP-hard on graphs of bounded directed treewidth, we then consider parameters that measure the distance from acyclicity of the underlying graph. On the positive side, we show that k-Digraph Coloring admits an FPT algorithm parameterized by treewidth, whose parameter dependence is (tw!)k^{tw}. Since this is considerably worse than the k^{tw} dependence of (undirected) k-Coloring, we pose the question of whether the tw! factor can be eliminated. Our main contribution in this part is to settle this question in the negative and show that our algorithm is essentially optimal, even for the much more restricted parameter treedepth and for k = 2. Specifically, we show that an FPT algorithm solving 2-Digraph Coloring with dependence td^o(td) would contradict the ETH.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Parameterized complexity and exact algorithms
  • Digraph Coloring
  • Dichromatic number
  • NP-completeness
  • Parameterized complexity
  • Feedback vertex and arc sets


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, and Stéphan Thomassé. Subdivisions in digraphs of large out-degree or large dichromatic number. Electron. J. Comb., 26(3):P3.19, 2019. Google Scholar
  2. Stephan Dominique Andres and Winfried Hochstättler. Perfect digraphs. Journal of Graph Theory, 79(1):21-29, 2015. Google Scholar
  3. Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 951-970. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.57.
  4. Julien Bensmail, Ararat Harutyunyan, and Ngoc-Khang Le. List coloring digraphs. Journal of Graph Theory, 87(4):492-508, 2018. Google Scholar
  5. Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon. Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth. CoRR, abs/2007.14179, 2020. URL: http://arxiv.org/abs/2007.14179.
  6. Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, and Jan Obdrzálek. The dag-width of directed graphs. J. Comb. Theory, Ser. B, 102(4):900-923, 2012. Google Scholar
  7. Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, and Bojan Mohar. The circular chromatic number of a digraph. Journal of Graph Theory, 46(3):227-240, 2004. URL: https://doi.org/10.1002/jgt.20003.
  8. Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, and Marcin Wrochna. On directed feedback vertex set parameterized by treewidth. In Andreas Brandstädt, Ekkehard Köhler, and Klaus Meer, editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, volume 11159 of Lecture Notes in Computer Science, pages 65-78. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-00256-5_6.
  9. Édouard Bonnet, Nick Brettell, O-joung Kwon, and Dániel Marx. Generalized feedback vertex set problems on bounded-treewidth graphs: Chordality is the key to single-exponential parameterized algorithms. Algorithmica, 81(10):3890-3935, 2019. URL: https://doi.org/10.1007/s00453-019-00579-4.
  10. Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, and Igor Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5):21:1-21:19, 2008. Google Scholar
  11. Xujin Chen, Xiaodong Hu, and Wenan Zang. A min-max theorem on tournaments. SIAM J. Comput., 37(3):923-937, 2007. URL: https://doi.org/10.1137/060649987.
  12. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  13. Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk. Solving connectivity problems parameterized by treewidth in single exponential time. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 150-159. IEEE Computer Society, 2011. URL: https://doi.org/10.1109/FOCS.2011.23.
  14. Tomás Feder, Pavol Hell, and Carlos S. Subi. Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR, abs/1907.00061, 2019. URL: http://arxiv.org/abs/1907.00061.
  15. Henning Fernau and Daniel Meister. Digraphs of bounded elimination width. Discret. Appl. Math., 168:78-87, 2014. Google Scholar
  16. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh. Intractability of clique-width parameterizations. SIAM J. Comput., 39(5):1941-1956, 2010. Google Scholar
  17. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Clique-width III: hamiltonian cycle and the odd case of graph coloring. ACM Trans. Algorithms, 15(1):9:1-9:27, 2019. Google Scholar
  18. Jakub Gajarský, Michael Lampis, and Sebastian Ordyniak. Parameterized algorithms for modular-width. In IPEC, volume 8246 of Lecture Notes in Computer Science, pages 163-176. Springer, 2013. Google Scholar
  19. Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, and Somnath Sikdar. Are there any good digraph width measures? J. Comb. Theory, Ser. B, 116:250-286, 2016. Google Scholar
  20. Frank Gurski, Dominique Komander, and Carolin Rehs. Acyclic coloring of special digraphs. CoRR, abs/2006.13911, 2020. URL: http://arxiv.org/abs/2006.13911.
  21. Ararat Harutyunyan. Brooks-type results for coloring of digraphs. PhD Thesis, Simon Fraser University, 2011. Google Scholar
  22. Ararat Harutyunyan, Mark Kayll, Bojan Mohar, and Liam Rafferty. Uniquely d-colorable digraphs with large girth. Canad. J. Math., 64(6):1310-1328, 2012. Google Scholar
  23. Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, and Hehui Wu. Coloring tournaments: From local to global. J. Comb. Theory, Ser. B, 138:166-171, 2019. Google Scholar
  24. Winfried Hochstättler, Felix Schröder, and Raphael Steiner. On the complexity of digraph colourings and vertex arboricity. Discret. Math. Theor. Comput. Sci., 22(1), 2020. Google Scholar
  25. Paul Hunter and Stephan Kreutzer. Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci., 399(3):206-219, 2008. Google Scholar
  26. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. Google Scholar
  27. Lars Jaffke and Bart M. P. Jansen. Fine-grained parameterized complexity analysis of graph coloring problems. In CIAC, volume 10236 of Lecture Notes in Computer Science, pages 345-356, 2017. Google Scholar
  28. Thor Johnson, Neil Robertson, Paul D. Seymour, and Robin Thomas. Directed tree-width. J. Comb. Theory, Ser. B, 82(1):138-154, 2001. Google Scholar
  29. Michael Lampis. Algorithmic meta-theorems for restrictions of treewidth. Algorithmica, 64(1):19-37, 2012. URL: https://doi.org/10.1007/s00453-011-9554-x.
  30. Michael Lampis. Finer tight bounds for coloring on clique-width. In ICALP, volume 107 of LIPIcs, pages 86:1-86:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  31. Michael Lampis, Georgia Kaouri, and Valia Mitsou. On the algorithmic effectiveness of digraph decompositions and complexity measures. Discret. Optim., 8(1):129-138, 2011. Google Scholar
  32. Zhentao Li and Bojan Mohar. Planar digraphs of digirth four are 2-colorable. SIAM J. Discret. Math., 31(3):2201-2205, 2017. Google Scholar
  33. Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. Known algorithms on graphs of bounded treewidth are probably optimal. ACM Trans. Algorithms, 14(2):13:1-13:30, 2018. Google Scholar
  34. Marcelo Garlet Millani, Raphael Steiner, and Sebastian Wiederrecht. Colouring non-even digraphs. CoRR, abs/1903.02872, 2019. URL: http://arxiv.org/abs/1903.02872.
  35. Bojan Mohar. Circular colorings of edge-weighted graphs. Journal of Graph Theory, 43(2):107-116, 2003. Google Scholar
  36. Bojan Mohar. Eigenvalues and colorings of digraphs. Linear Algebra and its Applications, 432(9):2273-2277, 2010. Special Issue devoted to Selected Papers presented at the Workshop on Spectral Graph Theory with Applications on Computer Science, Combinatorial Optimization and Chemistry (Rio de Janeiro, 2008). URL: https://doi.org/10.1016/j.laa.2009.05.027.
  37. Victor Neumann-Lara. The dichromatic number of a digraph. J. Comb. Theory, Ser. B, 33(3):265-270, 1982. Google Scholar
  38. Raphael Steiner and Sebastian Wiederrecht. Parameterized algorithms for directed modular width. In CALDAM, volume 12016 of Lecture Notes in Computer Science, pages 415-426. Springer, 2020. Google Scholar