Group Edge Choosability of Planar Graphs without Adjacent Short Cycles  

作　　者：Xin ZHANG Gui Zhen LIU 

机构地区：[1]Department of Mathematics,Xidian University [2]School of Mathematics,Shandong University

出　　处：《Acta Mathematica Sinica,English Series》2013年第11期2079-2086,共8页数学学报（英文版）

基　　金：Supported by the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2013JQ1002);the Fundamental Research Funds for the Central Universities(Grant No.K5051370003);National Natural Science Foundation of China(Grant Nos.11101243,11201440,11301410 and 61070230)

摘　　要：In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group （△ （G）＋1）-edge-choosable, and some planar graphs with large girth and maximum degree are group △（G）-edge-choosable.In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group （△ （G）＋1）-edge-choosable, and some planar graphs with large girth and maximum degree are group △（G）-edge-choosable.

关 键 词：Group edge coloring list coloring planar graphs short cycles GIRTH 

分 类 号：O157.5[理学—数学]