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
New methods to color the vertices of a graph
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
An exact method for graph coloring
Computers and Operations Research
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics
A semidefinite programming-based heuristic for graph coloring
Discrete Applied Mathematics
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Discrete Applied Mathematics
Efficient algorithms for finding critical subgraphs
Discrete Applied Mathematics
Variable space search for graph coloring
Discrete Applied Mathematics
Heuristics for a project management problem with incompatibility and assignment costs
Computational Optimization and Applications
An exact approach for the Vertex Coloring Problem
Discrete Optimization
On optimal k-fold colorings of webs and antiwebs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has the same chromatic number as G. Such a subgraph is said critical since all proper induced sub-graph of G' have a chromatic number strictly smaller than G'.The proposed method is particularly helpful when a k-coloring of a non-critical graph is known, and it has to be proved that no (k-1)-coloring of G exists. Computational experiments on random graphs and on DIMACS benchmark problems demonstate that the new proposed algorithm can solve larger problem than previous known exact methods.