A topological lower bound for the circular chromatic number of Schrijver graphs
Frédéric Meunier · Journal of Graph Theory · 2005
Abstract In this paper, we prove that the Kneser graphs defined on a ground set of n elements, where n is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005