Choosability of Toroidal Graphs Without Short Cycles

被引：9

作者：

Cai, Leizhen ^{[1
]}

Wang, Weifan ^{[2
]}

Zhu, Xuding ^{[3
]}

机构：

[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China

[2] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China

[3] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 804, Taiwan

来源：

JOURNAL OF GRAPH THEORY | 2010年 / 65卷 / 01期

关键词：

choosability; list coloring; toroidal graph; cycle; discharging method; PLANAR GRAPHS; EDGE CHOOSABILITY; THEOREM; TORUS; COLORINGS; SURFACES;

D O I：

10.1002/jgt.20460

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a toroidal graph without cycles of a fixed length k, and xi(G) the list chromatic number of G. We establish tight upper bounds of chi(G) for the following values of k: chi(G)<={4 if k is an element of {3,4,5} 5 if k=6 6 if k=7 (C) 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1-15, 2010

引用

页码：1 / 15

页数：15

共 50 条

[21] On (3,1)*-choosability of planar graphs without adjacent short cycles
Chen, Min
Raspaud, Andre
DISCRETE APPLIED MATHEMATICS, 2014, 162 : 159 - 166
[22] Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles
Borodin, O. V.
Ivanova, A. O.
JOURNAL OF GRAPH THEORY, 2011, 68 (02) : 169 - 176
[23] (3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles
HAIHUI ZHANG
Proceedings - Mathematical Sciences, 2016, 126 : 159 - 165
[24] The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles
Lu, Huajing
Li, Fengwei
AXIOMS, 2023, 12 (02)
[25] The 4-choosability of toroidal graphs without intersecting triangles
Luo Xiaofang
INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 85 - 91
[26] (3,1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles
Zhang, Haihui
PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 2016, 126 (02): : 159 - 165
[27] Edge choosability of planar graphs without small cycles
Zhang, L
Wu, BYD
DISCRETE MATHEMATICS, 2004, 283 (1-3) : 289 - 293
[28] Choosability with separation of planar graphs without prescribed cycles
Chen, Min
Fan, Yingying
Raspaud, Andre
Shiu, Wai Chee
Wang, Weifan
APPLIED MATHEMATICS AND COMPUTATION, 2020, 367
[29] Adaptable choosability of planar graphs with sparse short cycles
Guan, Albert
Zhu, Xuding
DISCRETE MATHEMATICS, 2009, 309 (20) : 6044 - 6047
[30] Edge choosablity and total choosability of toroidal graphs without intersecting triangles
Li, Rui
Xu, Baogang
ARS COMBINATORIA, 2012, 103 : 109 - 118

← 1 2 3 4 5 →