(3,1)-Choosability of toroidal graphs with some forbidden short cycles

被引:0
作者
Jing, Yubo [1 ]
Wang, Yingqian [1 ]
机构
[1] Zhejiang Normal Univ, Coll Math Phys & Informat Engn, Jinhua 321004, Peoples R China
关键词
Toroidal graph; Cycle; Improper choosability; PLANAR GRAPHS; IMPROPER;
D O I
10.1016/j.dam.2014.10.030
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Lih et al. showed that every planar graph without 4-cycles or i-cycles for some i is an element of {5, 6, 7} is (3, 1)-choosable. Dong and Xu showed that every toroidal graph without 4-cycles or 6-cycles is (3, 1)-choosable. In this paper, we show that every toroidal graph without 4-cycles or i-cycles for some i is an element of {5, 7} is also (3, 1)-choosable. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:243 / 247
页数:5
相关论文
共 9 条
[1]   On (3,1)*-choosability of planar graphs without adjacent short cycles [J].
Chen, Min ;
Raspaud, Andre .
DISCRETE APPLIED MATHEMATICS, 2014, 162 :159-166
[2]   ON (3, 1) - CHOOSABILITY OF TOROIDAL GRAPHS [J].
Dong, Wei ;
Xu, Baogang .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (02) :291-297
[3]   A note on list improper coloring of plane graphs [J].
Dong, Wei ;
Xu, Baogang .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) :433-436
[4]  
Eaton N., 1999, Bull. Inst. Combin. Appl., V25, P79
[5]   A note on list improper coloring planar graphs [J].
Lih, KW ;
Song, ZM ;
Wang, WF ;
Zhang, KM .
APPLIED MATHEMATICS LETTERS, 2001, 14 (03) :269-273
[6]   List improper colourings of planar graphs [J].
Skrekovski, R .
COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (03) :293-299
[7]   IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES [J].
Wang, Yingqian ;
Xu, Lingji .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) :2029-2037
[8]  
Xu BG, 2008, UTILITAS MATHEMATICA, V76, P183
[9]   Every toroidal graph without adjacent triangles is (4,1)*-choosable [J].
Xu, Baogang ;
Zhang, Haihui .
DISCRETE APPLIED MATHEMATICS, 2007, 155 (01) :74-78