Tight relation between the circular chromatic number and the girth of series-parallel graphs

被引:5
作者
Pan, ZS [1 ]
Zhu, XD [1 ]
机构
[1] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 80424, Taiwan
关键词
circular chromatic number; two-terminal series-parallel graph; girth; odd girth;
D O I
10.1016/S0012-365X(01)00376-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper proves the sharpness of an upper bound for the circular chromatic number of series-parallel graphs of large girth. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:393 / 404
页数:12
相关论文
共 21 条
[1]   A NOTE ON THE STAR CHROMATIC NUMBER [J].
BONDY, JA ;
HELL, P .
JOURNAL OF GRAPH THEORY, 1990, 14 (04) :479-482
[2]  
Chien CY, 2000, J GRAPH THEOR, V33, P185, DOI 10.1002/(SICI)1097-0118(200004)33:4<185::AID-JGT1>3.0.CO
[3]  
2-N
[4]  
FIJAVZ G, 2001, UNPUB CIRCULAR COLOR
[5]   High-girth graphs avoiding a minor are nearly bipartite [J].
Galluccio, A ;
Goddyn, LA ;
Hell, P .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (01) :1-14
[6]  
Hell P, 2000, J GRAPH THEOR, V33, P14, DOI 10.1002/(SICI)1097-0118(200001)33:1<14::AID-JGT2>3.0.CO
[7]  
2-#
[8]  
Klostermeyer W, 2000, J GRAPH THEOR, V33, P109, DOI 10.1002/(SICI)1097-0118(200002)33:2<109::AID-JGT5>3.0.CO
[9]  
2-F
[10]  
LIAW S, IN PRESS DISCRETE MA