An approximate chromatic number of a graph
Dănuţ Marcu · Journal of Discrete Mathematical Sciences and Cryptography · 2008
In this paper, we present a very simple polynomial and greedy algorithm, with a computer program, for finding an approximate value of the chromatic number (an upper bound) γ(G) of a given finite and simple graph G.