Circular chromatic numbers of some reduced Kneser graphs
Ko‐Wei Lih, Daphne Der‐Fen Liu · Journal of Graph Theory · 2002
Abstract The vertex set of the reduced Kneser graph KG2(m,2) consists of all pairs {a,b} such that a, bε{1,2,…,m} and 2≤|a−b|≤m−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if m≥4 and m≠5, then the circular chromatic number of KG2(m,2) is equal to m−2, its ordinary chromatic number. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 62–68, 2002