ChromaticCliqueGap on LabeledGraph
The chromatic number less the clique number.
FindStat's St001793, which is 0 on a weakly perfect graph. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "ChromaticCliqueGap"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001793
The difference between the clique number and the chromatic number of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001793 has the rest.