Efficient algorithms for finding critical subgraphs

This paper presents algorithms to find vertex-critical and edgecritical 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.

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Christian Desrosiers, Philippe Galinier, Alain Hertz
• Keywords: Chromatic Number, DAM 2008, Edgecritical Subgraphs, Lower Bound