A topological lower bound for the circular chromatic number of Schrijver graphs.

Frédéric Meunier

Published in: J. Graph Theory (2005)

Keyphrases

lower bound
objective function
computational complexity
upper bound
small number
np hard
worst case
memory requirements
maximum number
data sets
branch and bound
finite number