The core of a graph
Data up to Jan 2025
Total Citations Per Year
Abstract
References (14)
On the complexity of H-coloring
1990 • 682 citations
Graphs and Combinatorics
1974 • 220 citations
Fixed-edge theorem for graphs with loops
1979 • 90 citations
The Complexity of Colouring by Semicomplete Digraphs
1988 • 78 citations
Color-families are dense
1982 • 68 citations
The effect of two cycles on the complexity of colourings by directed graphs
1990 • 58 citations
Absolute retracts in graphs
1974 • 49 citations
Chromatically optimal rigid graphs
1989 • 39 citations
Minimum node covers and 2-bicritical graphs
1979 • 39 citations
Endomorphisms of graphs II. Various unretractive graphs
1990 • 25 citations
On minimal graphs
1982 • 23 citations
Unretractive and S‐unretractive joins and lexicographic products of graphs
1987 • 22 citations
Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
1973 • 16 citations
Cohomomorphisms of graphs and hypergraphs
1979 • 11 citations