An algorithm for determining the chromatic number of a graph

Loading...
Thumbnail Image
Date
1975
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
An algorithm for determining the chromatic number of a graph is presented. The storage requirement is on the order of the square of the number of vertices in the graph. Preliminary empirical tests indicate this algorithm is faster than previous algorithms.
Description
Keywords
Citation
Collections