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

被引：18
|
作者：
Meunier, F [1 ]
机构：
[1] Imag Lab Grenoble, Lab Leibniz, F-38031 Grenoble, France
来源：
JOURNAL OF GRAPH THEORY | 2005年 / 49卷 / 04期
关键词：
circular chromatic number; Fan's theorem; Kneser graphs; topological methods;
D O I：
10.1002/jgt.20079
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 2005 Wiley Periodicals, Inc.
引用
收藏
页码：257 / 261
页数：5
相关论文
共 50 条
12345