Circular chromatic number and graph minors

被引：9
|
作者：
Zhu, XD [1 ]
机构：
[1] Natl Sun Yat Sen Univ, Dept Math Appl, Kaohsiung 80424, Taiwan
来源：
TAIWANESE JOURNAL OF MATHEMATICS | 2000年 / 4卷 / 04期
关键词：
K-n-minor free; Hadwiger's conjecture; circular chromatic number;
D O I：
10.11650/twjm/1500407298
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper proves that for any integer n greater than or equal to 4 and any rational number r, 2 less than or equal to r less than or equal to n - 2, there exists a graph G which has circular chromatic number r and which does not contain K-n as a minor.
引用
收藏
页码：643 / 660
页数：18
相关论文
共 50 条
12345