A note on the complexity of the chromatic number problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
A New Algorithm for Generating All the Maximal Independent Sets
1977 • 610 citations
Graph Theory and Computing
1972 • 607 citations
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
1972 • 536 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
Chromatic Scheduling and the Chromatic Number Problem
1972 • 143 citations
Combinatorial Programming: Methods and Applications
1976 • 112 citations
An algorithm for the chromatic number of a graph
1971 • 91 citations
Corrections to Bierstone's Algorithm for Generating Cliques
1972 • 72 citations
An Algorithm for Determining the Chromatic Number of a Graph
1973 • 41 citations
An Algorithm for the Chromatic Number of a Graph
1974 • 23 citations
How to Color a Graph
1975 • 7 citations