Acyclic homomorphisms and circular colorings of digraphs

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 1, 2003, Pages 161-169

  Feder, Tomás ^a   Hell, Pavol ^b   Mohar, Bojan ^c  

^a Simon Fraser University ^*  (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Acyclic homomorphism; Circular chromatic number; Circular coloring; Digraph; Graph homomorphism; NP completeness

Indexed keywords

CONSTRAINT THEORY; DECISION THEORY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

ACYCLIC HOMOMORPHISM; CIRCULAR CHROMATIC NUMBER; CIRCULAR COLORING; DIGRAPH; GRAPH HOMOMORPHISM; NP-COMPLETENESS;

GRAPH THEORY;

EID: 1442331451     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103422184     Document Type: Article

References (15)

1. J. BANG-JENSEN, P. HELL, AND G. MACGILLIVRAY, On the complexity of colouring by super-graphs of bipartite graphs, Discrete Math., 109 (1992), pp. 27-44.
2. J. BANG-JENSEN, P. HELL, AND G. MACGILLIVRAY, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Appl. Math., 26 (1990), pp. 1-23.
3. J. BANG-JENSEN, P. HELL, AND G. MACGILLIVRAY, The complexity of colourings by semicomplete digraphs, SIAM J. Discrete Math., 1 (1988), pp. 281-298.
4. D. BOKAL, G. FIJAVŽ, P. M. KAYLL, M. JUVAN, AND B. MOHAR, The circular chromatic number of a digraph, J. Graph Theory, submitted.
5. J. A. BONDY AND P. HELL, A note on the star chromatic number, J. Graph Theory, 14 (1990), pp. 479-482.
6. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-cornpleteness, W. H. Freeman, San Francisco, 1979.
8. D. R. GUICHARD, Acyclic graph coloring and the complexity of the star chromatic number, J. Graph Theory, 17 (1993), pp. 129-134.
9. H. HATAMI AND R. TUSSERKANI, On the Complexity of the Circular Chromatic Number, manuscript, 2002.
10. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
11. P. HELL AND J. NEŠETŘIL, Counting list homomorphisms and graphs with bounded degrees, Discrete Math., to appear.
12. P. HELL, J. NEŠETŘIL, AND X. ZHU, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc., 348 (1996), pp. 147-156.
13. H. A. MAURER, J. H. SUDBOROUGH, AND E. WELZL, On the complexity of the general colouring problem, Inform. and Control, 51 (1981), pp. 123-145.
14. B. MOHAR, Circular colorings of edge-weighted graphs, J. Graph Theory, 43 (2003), pp. 107-116.
15. X. ZHU, Circular chromatic number: A survey, Discrete Math., 229 (2001), pp. 371-410.