Geodesic
Clique number estimate based on coloring of the nodes
Serdica Mathematical Journal, Tome 47 (2021) no. 1, pp. 31-44.

Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library

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.
Keywords: clique number, chromatic number, maximum clique, greedy coloring, clique number estimates, 05C15, 05B45, 52C22 
@article{SMJ2_2021_47_1_a2,
     author = {Szab\'o, S\'andor and Zavalnij, Bogd\'an},
     title = {Clique number estimate  based on coloring of the nodes},
     journal = {Serdica Mathematical Journal},
     pages = {31--44},
     publisher = {mathdoc},
     volume = {47},
     number = {1},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SMJ2_2021_47_1_a2/}
}
TY  - JOUR
AU  - Szabó, Sándor
AU  - Zavalnij, Bogdán
TI  - Clique number estimate  based on coloring of the nodes
JO  - Serdica Mathematical Journal
PY  - 2021
SP  - 31
EP  - 44
VL  - 47
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SMJ2_2021_47_1_a2/
LA  - en
ID  - SMJ2_2021_47_1_a2
ER  - 
%0 Journal Article
%A Szabó, Sándor
%A Zavalnij, Bogdán
%T Clique number estimate  based on coloring of the nodes
%J Serdica Mathematical Journal
%D 2021
%P 31-44
%V 47
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SMJ2_2021_47_1_a2/
%G en
%F SMJ2_2021_47_1_a2
Szabó, Sándor; Zavalnij, Bogdán. Clique number estimate  based on coloring of the nodes. Serdica Mathematical Journal, Tome 47 (2021) no. 1, pp. 31-44. http://geodesic.mathdoc.fr/item/SMJ2_2021_47_1_a2/