The core of a graph

On the complexity of H-coloring

Pavol Hell, Jaroslav Nešetřil · Journal of Combinatorial Theory Series B · 1990 · 663 citations

Combinatorics On Word, Computational Complexity Theory, Engineering +4

Fixed‐edge theorem for graphs with loops

Richard J. Nowakowski, Ivan Rival · Journal of Graph Theory · 1979 · 89 citations

The Complexity of Colouring by Semicomplete Digraphs

Jørgen Bang‐Jensen, Pavol Hell, Gary MacGillivray · SIAM Journal on Discrete Mathematics · 1988 · 78 citations

Directed Graph, Engineering, Graph Theory +14

Color-families are dense

Emo Welzl · Theoretical Computer Science · 1982 · 65 citations · Full text

Color Reproduction, Graph Theory, Colorization +14

The effect of two cycles on the complexity of colourings by directed graphs

Jørgen Bang‐Jensen, Pavol Hell · Discrete Applied Mathematics · 1990 · 56 citations

Directed Graph, Engineering, Graph Theory +9