The rate of growth of the minimum clique size of graphs of given order and chromatic number.

Csaba Biró Kris Wease

Published in: Discret. Math. (2015)

Keyphrases

maximum number
small number
computational complexity
growth rate

maximum distance
data sets
color images
graph structure

space complexity
total length
code length
markov random field

directed graph
random sample
largest number