An Alternate method to find the chromatic number of a Finite, Connected Graph [article]

Athma. M. Ram, R. Rama
2019 arXiv   pre-print
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:1309.3642v3 fatcat:g7ehvrv4ifcxtgwkeljxpx2ybi