An Alternate method to find the chromatic number of a Finite, Connected Graph
Discrete Mathematics
2019-10-16 v3 Combinatorics
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.
Cite
@article{arxiv.1309.3642,
title = {An Alternate method to find the chromatic number of a Finite, Connected Graph},
author = {Athma. M. Ram and R. Rama},
journal= {arXiv preprint arXiv:1309.3642},
year = {2019}
}
Comments
It's garbage