An analogue of Hajos' Theorem for the circular chromatic number (II)

被引：2
|
作者：
Zhu, XD [1 ]
机构：
[1] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 80424, Taiwan
来源：
GRAPHS AND COMBINATORICS | 2003年 / 19卷 / 03期
关键词：
D O I：
10.1007/s00373-002-0505-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper designs a set of graph operations, and proves that for 2 less than or equal to k/d < 3, starting from K-k/d, by repeatedly applying these operations, one can construct all graphs G with χ(c)(G) ≥ k/d. Together with the result proved in [20], where a set of graph operations were designed to construct graphs G with χ(c)(G) ≥ k/d for k/d ≥ 3, we have a complete analogue of Hajos' Theorem for the circular chromatic number.
引用
收藏
页码：419 / 432
页数：14
相关论文
共 50 条
12345