ArticlesFinding the chromatic number by means of critical graphs
References (7)
New Methods to Color the Vertices of a Graph
Communications of the ACM
(1979)Chromatic Scheduling and the Chromatic Number Problem
Management Science
(1972)- et al.
Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS
Series in Discrete Mathematics and Theoretical Computer Science
(1996)
There are more references available in the full text version of this article.
Cited by (2)
A new heuristic for finding verifiable k-vertex-critical subgraphs
2022, Journal of HeuristicsA structure-driven genetic algorithm for graph coloring
2021, Computacion y Sistemas
Copyright © 2002 Elsevier Ltd. All rights reserved.