Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

被引：16
|
作者：
Li, Rui [1 ,2 ]
Xu, Baogang [1 ]
机构：
[1] Nanjing Normal Univ, Sch Math Sci, Nanjing 210046, Peoples R China
[2] Shihezi Univ, Normal Coll, Shihezi 832003, Xinjiang, Peoples R China
来源：
DISCRETE MATHEMATICS | 2011年 / 311卷 / 20期
关键词：
List total coloring; List edge coloring; Planar graphs; LIST-TOTAL COLORINGS;
D O I：
10.1016/j.disc.2011.06.031
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. we prove that chi ''(i) (G) <= Delta(G) + 2 if Delta(G) >= 6, and chi'(l)(G) = Delta(G) and chi(l)'' (G) = Delta(G) + 1 if Delta(G) >= 8, where x'(i) (G) and x ''(i) (G) denote the list edge chromatic number and list total chromatic number of G, respectively. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码：2158 / 2163
页数：6
相关论文
共 50 条
  • [1] Structural properties and edge choosability of planar graphs without 4-cycles
    Shen, Yufa
    Zheng, Guoping
    He, Wenjie
    Zhao, Yongqiang
    [J]. DISCRETE MATHEMATICS, 2008, 308 (23) : 5789 - 5794
  • [2] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [3] A note on edge-choosability of planar graphs without intersecting 4-cycles
    Ma Q.
    Wang J.
    Cai J.
    Zhang S.
    [J]. Journal of Applied Mathematics and Computing, 2011, 36 (1-2) : 367 - 372
  • [4] Edge-(k, l)-Choosability of Planar Graphs without 4-Cycles
    Zheng, Guoping
    Shen, Yufa
    Wang, Jinran
    Gao, Mingjing
    [J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2009, 8 : 878 - 880
  • [5] Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
    Wang, Jihui
    Cai, Jiansheng
    Ma, Qiaoling
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 206 : 215 - 219
  • [6] Choosability and edge choosability of planar graphs without five cycles
    Wang, WF
    Lih, KW
    [J]. APPLIED MATHEMATICS LETTERS, 2002, 15 (05) : 561 - 565
  • [7] Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles
    Lin SUN
    [J]. Acta Mathematica Sinica,English Series, 2021, 37 (06) : 992 - 1004
  • [8] TOTAL COLORINGS OF EMBEDDED GRAPHS WITH NO 3-CYCLES ADJACENT TO 4-CYCLES
    Wang, Bing
    Wu, Jian-Liang
    Sun, Lin
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 977 - 989
  • [9] Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles
    Sun, Lin
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2021, 37 (06) : 992 - 1004
  • [10] Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles
    Lin Sun
    [J]. Acta Mathematica Sinica, English Series, 2021, 37 : 992 - 1004
12345