20 citations · 65 across the 20 of their papers we have counts for
1 paper · 2 filters
Ayan Nandy, Sagnik Sen, Eric Sopena
The clique number of an undirected graph G is the maximum order of a complete subgraph of G and is a well-known lower bound for the chromatic number of G. Every proper k-co…