Sciweavers

ENDM
2000
121views more  ENDM 2000»
13 years 4 months ago
Finding the chromatic number by means of critical graphs
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 t...
Francine Herrmann, Alain Hertz