A note on list edge and list total coloring of planar graphs without adjacent short cycles

被引：0
作者：
Hui Juan Wang
Jian Liang Wu
机构：
[1] Shandong University,School of Mathematics
来源：
Acta Mathematica Sinica, English Series | 2014年 / 30卷
关键词：
List edge coloring; list total coloring; planar graph; cycle; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G be a planar graph with maximum degree Δ. In this paper, we prove that if any 4-cycle is not adjacent to an i-cycle for any i ∈ {3, 4} in G, then the list edge chromatic number xl′ (G) = Δ and the list total chromatic number xl″ (G) = Δ+1.
引用
收藏
页码：91 / 96
页数：5
相关论文
共 31 条
  • [1] Borodin O V(1997)List edge and list total colourings of multigraphs J. Combin. Theory Ser. B 71 184-204
  • [2] Kostochka A V(2010)On the total choosability of planar graphs and of sparse graphs Inform. Process. Lett. 110 849-853
  • [3] Woodall D R(2012)(Δ + 1)-total choosability of planar graphs with no cycles of length from 4 to Discrete Math. 312 2126-2130
  • [4] Chang G(1992) and without close triangles J. Graph Theory 16 503-516
  • [5] Hou J(2007)Some upper bounds on the total and list chromatic numbers of multigraphs Lect. Notes Comput. Sci. Eng. 4489 320-328
  • [6] Roussel N(2006)Some results on list total colorings of planar graphs Theoret. Comput. Sci. 369 250-255
  • [7] Chang G(2011)List edge and list total colorings of planar graphs without 4-cycles Discrete Math. 311 2158-2163
  • [8] Roussel N(2011)Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles Acta Math. Sin., Engl. Series 27 2437-2444
  • [9] Hägkvist R(2009)List total coloring of planar graphs without triangles at small distance Discrete Math. 309 6035-6043
  • [10] Chetwynd A(2008)Total colorings and list total colorings of planar graphs without intersecting 4-cycles Inform. Process. Lett. 108 347-351
1234