Smallest-last ordering and clustering and graph coloring algorithms

Graph theory

1969 • 11,244 citations

Reducibility among Combinatorial Problems

1972 • 10,743 citations

New methods to color the vertices of a graph

1979 • 1,548 citations

On colouring random graphs

1975 • 367 citations

The Complexity of Near-Optimal Graph Coloring

1976 • 314 citations

GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.

1972 • 227 citations

An inequality for the chromatic number of a graph

1968 • 216 citations

k-Components, Clusters and Slicings in Graphs

1972 • 109 citations

On the theory and construction of k-clusters

1972 • 100 citations

Graph Theoretic Techniques for Cluster Analysis Algorithms

1977 • 84 citations

Graph Coloring Algorithms

2000 • 41 citations

Two linear-time algorithms for five-coloring a planar graph

1980 • 27 citations

Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen

1969 • 24 citations

Bounded color functions on graphs

1972 • 13 citations

Subgraph connectivity numbers of a graph

1978 • 13 citations