论文信息 - The complexity of colouring by locally semicomplete digraphs

The complexity of colouring by locally semicomplete digraphs

In this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed locally semicomplete digraphs. It is also shown that the same dichotomy holds for list homomorphisms. The polynomial algorithms follow from a different, shorter proof of a result by Gutjahr, Welzl and Woeginger.

[1] Gerhard J. Woeginger,et al. Polynomial Graph-Colorings , 1989, STACS.

[2] Gary MacGillivray,et al. The Complexity of Colouring by Semicomplete Digraphs , 1988, SIAM J. Discret. Math..

[3] Gary MacGillivray,et al. A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles , 2011, Contributions Discret. Math..

[4] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[5] Libor Barto,et al. The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) , 2008, SIAM J. Comput..

[6] Pavol Hell,et al. On homomorphisms to acyclic local tournaments , 1995, J. Graph Theory.

[7] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[8] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[9] Jørgen Bang-Jensen,et al. The effect of two cycles on the complexity of colourings by directed graphs , 1989, Discret. Appl. Math..

[10] Gregory Gutin,et al. Digraphs - Theory, Algorithms and Applications, Second Edition , 2009, Springer Monographs in Mathematics.

[11] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.

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