Acyclic Homomorphisms and Circular Colorings of Digraphs
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
1998 • 1,102 citations
On the complexity of H-coloring
1990 • 682 citations
Circular chromatic number
2001 • 343 citations
A note on the star chromatic number
1990 • 171 citations
Duality and Polynomial Testing of Tree Homomorphisms
1996 • 104 citations
The Complexity of Colouring by Semicomplete Digraphs
1988 • 78 citations
On the complexity of the general coloring problem
1981 • 60 citations
The effect of two cycles on the complexity of colourings by directed graphs
1990 • 58 citations
Acyclic graph coloring and the complexity of the star chromatic number
1993 • 49 citations
Circular colorings of edge‐weighted graphs
2003 • 37 citations
Counting List Homomorphisms and Graphs with Bounded Degrees.
2001 • 28 citations
On the complexity of colouring by superdigraphs of bipartite graphs
1992 • 18 citations
On the Complexity of the Circular Chromatic Number
2007 • 8 citations
Deleted Work
1955 • 0 citations