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 条

[1] A topological lower bound for the chromatic number of a special family of graphs
Daneshpajouh, Hamid Reza
DISCRETE MATHEMATICS, 2018, 341 (02) : 508 - 512
[2] A lower bound on the chromatic number of Mycielski graphs
Caramia, M
Dell'Olmo, P
DISCRETE MATHEMATICS, 2001, 235 (1-3) : 79 - 86
[3] Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number
Gujgiczer, Anna
Simonyi, Gabor
GRAPHS AND COMBINATORICS, 2024, 40 (03)
[4] Graphs whose circular chromatic number equals the chromatic number
Zhu, XD
COMBINATORICA, 1999, 19 (01) : 139 - 149
[5] Graphs Whose Circular Chromatic Number Equals the Chromatic Number
Xuding Zhu
Combinatorica, 1999, 19 : 139 - 149
[6] Improved lower bound for the list chromatic number of graphs with no Kt minor
Steiner, Raphael
COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (06): : 1070 - 1075
[7] On the circular chromatic number of circular partitionable graphs
Pecher, Arnaud
Zhu, Xuding
JOURNAL OF GRAPH THEORY, 2006, 52 (04) : 294 - 306
[8] A bound for the game chromatic number of graphs
Dinski, T
Zhu, XD
DISCRETE MATHEMATICS, 1999, 196 (1-3) : 109 - 115
[9] CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS
刘红美
Acta Mathematica Scientia, 2006, (02) : 314 - 320
[10] Circular Chromatic Number and Mycielski Graphs
Genghua Fan
Combinatorica, 2004, 24 : 127 - 135

← 1 2 3 4 5 →