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 条

[21] THE STAR CHROMATIC NUMBER OF A GRAPH
ABBOTT, HL
ZHOU, B
JOURNAL OF GRAPH THEORY, 1993, 17 (03) : 349 - 360
[22] An approximate chromatic number of a graph
Marcu, Danut
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2008, 11 (04): : 461 - 464
[23] The chromatic number of a signed graph
Macajova, Edita
Raspaud, Andre
Skoviera, Martin
ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (01):
[24] On the quantum chromatic number of a graph
Cameron, Peter J.
Montanaro, Ashley
Newman, Michael W.
Severini, Simone
Winter, Andreas
ELECTRONIC JOURNAL OF COMBINATORICS, 2007, 14 (01):
[25] The chromatic covering number of a graph
Naserasr, R
Tardif, C
JOURNAL OF GRAPH THEORY, 2006, 51 (03) : 199 - 204
[26] The chromatic number of graph powers
Alon, N
Mohar, B
COMBINATORICS PROBABILITY & COMPUTING, 2002, 11 (01): : 1 - 10
[27] THE MULTISET CHROMATIC NUMBER OF A GRAPH
Chartrand, Gary
Okamoto, Futaba
Salehi, Ebrahim
Zhang, Ping
MATHEMATICA BOHEMICA, 2009, 134 (02): : 191 - 209
[28] THE STRONG CHROMATIC NUMBER OF A GRAPH
ALON, N
RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (01) : 1 - 7
[29] Rank and chromatic number of a graph
Kotlov, A
JOURNAL OF GRAPH THEORY, 1997, 26 (01) : 1 - 8
[30] Circular chromatic number of subgraphs
Hajiabolhassan, H
Zhu, XD
JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 95 - 105

← 1 2 3 4 5 →