A generalized implicit enumeration algorithm for graph coloring
Communications of the ACM - Lecture notes in computer science Vol. 174
A correction to Brelaz's modification of Brown's coloring algorithm
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding the chromatic number by means of critical graphs
Journal of Experimental Algorithmics (JEA)
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics
Variable space search for graph coloring
Discrete Applied Mathematics
Hi-index | 0.04 |
This paper presents algorithms to find vertex-critical and edge-critical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the chromatic number of G. Computational experiments are reported on random and DIMACS benchmark graphs to compare the proposed algorithms, as well as to find lower bounds on the chromatic number of these graphs. We improve the best known lower bound for some of these graphs, and we are even able to determine the chromatic number of some graphs for which only bounds were known.