List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles

被引：3
作者：
Cai, Jiansheng [1 ]
机构：
[1] Weifang Univ, Sch Math & Informat Sci, Weifang 261061, Shandong, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2015年 / 31卷 / 04期
关键词：
Planar graph; Coloring; Choosability; Combinatorial problem; CHOOSABILITY;
D O I：
10.1007/s00373-014-1420-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is edge--colorable if for a given edge assignment L = {L(e) : e is an element of E(G)},, there exits a proper edge-coloring of such that for all e is an element of E(G). If is edge--colorable for every edge assignment with for e is an element of E(G), then is said to be edge--choosable. In this paper, we prove that if is a planar graph without non-induced -cycles, then is edge--choosable, where k = max{8, Delta (G) + 1}.
引用
收藏
页码：827 / 832
页数：6
相关论文
共 23 条
  • [1] Borodin O.V., 1990, Mat. Zametki, V48, P22
  • [2] List edge and list total colourings of multigraphs
    Borodin, OV
    Kostochka, AV
    Woodall, DR
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 71 (02) : 184 - 204
  • [3] Edge-choosability of planar graphs without non-induced 5-cycles
    Cai, Jiansheng
    Hou, Jianfeng
    Zhang, Xia
    Liu, Guizhen
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (07) : 343 - 346
  • [4] Erdos P., 1980, C NUMERANTUM, P125
  • [5] THE LIST CHROMATIC INDEX OF A BIPARTITE MULTIGRAPH
    GALVIN, F
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) : 153 - 158
  • [6] Haggkvist R., 1997, Combinatorics, Probability and Computing, V6, P295, DOI 10.1017/S0963548397002927
  • [7] SOME UPPER-BOUNDS ON THE TOTAL AND LIST CHROMATIC-NUMBERS OF MULTIGRAPHS
    HAGGKVIST, R
    CHETWYND, A
    [J]. JOURNAL OF GRAPH THEORY, 1992, 16 (05) : 503 - 516
  • [8] Total colorings of planar graphs without small cycles
    Hou, Jianfeng
    Zhu, Yan
    Liu, Guizhen
    Wu, Jianliang
    Lan, Mei
    [J]. GRAPHS AND COMBINATORICS, 2008, 24 (02) : 91 - 100
  • [9] List edge and list total colorings of planar graphs without 4-cycles
    Hou, Jianfeng
    Liu, Guizhen
    Cai, Jiansheng
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 250 - 255
  • [10] Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
    Hou, Jianfeng
    Liu, Guizhen
    Cai, Jiansheng
    [J]. DISCRETE MATHEMATICS, 2009, 309 (01) : 77 - 84
123