Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints

We consider acyclic r-colorings in graphs and digraphs: they color the vertices in r colors, each of which induces an acyclic graph or digraph. (This includes the dichromatic number of a digraph, and the arboricity of a graph.) For any girth and sufficiently high degree, we prove the NP-completeness of acyclic r-colorings; our method also implies the known analogue for classical colorings. The proofs use high girth graphs with high arboricity and dichromatic numbers. High girth graphs and digraphs with high chromatic and dichromatic numbers have been well studied; we re-derive the results from a general result about relational systems, which also implies the similar fact about high girth and high arboricity used in the proofs. These facts concern graphs and digraphs of high girth and low degree; we contrast them by considering acyclic colorings of tournaments (which have low girth and high degree). We prove that even though acyclic two-colorability of tournaments is known to be NP-complete, random acyclically r-colorable tournaments allow recovering an acyclic r-coloring in deterministic linear time, with high probablity.

[1]  L. Lovász.  On chromatic number of finite set-systems , 1968 .

[2]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[3]  Tomás Feder,et al.  Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection , 2006, SIAM J. Discret. Math..

[4]  Jørgen Bang-Jensen,et al.  Finding good 2-partitions of digraphs I. Hereditary properties , 2016, Theor. Comput. Sci..

[5]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[6]  Stefan Hougardy,et al.  Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth , 1998, Combinatorics, Probability and Computing.

[7]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[8]  Paul Erdös,et al.  A Problem on Tournaments , 1964, Canadian Mathematical Bulletin.

[9]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Avi Wigderson,et al.  2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction , 2012 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Bojan Mohar,et al.  The circular chromatic number of a digraph , 2004, J. Graph Theory.

[14]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[15]  Jørgen Bang-Jensen,et al.  Finding good 2-partitions of digraphs II. Enumerable properties , 2016, Theor. Comput. Sci..