Clique number estimate based on coloring of the nodes
Sándor Szabó, Bogdán Zaválnij · Serdica Mathematical Journal · 2021
We will describe an algorithm to establish an upper estimate of the clique number of a given graph. The procedure is based on greedy legal coloring of the nodes. In order to assess the performance of the procedure we carried out a large scale numerical experiment.