An Alternate method to find the chromatic number of a Finite, Connected Graph
arXiv:1309.3642
Abstract
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
arXiv commentIt's garbage