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 △（...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.展开更多
基金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.
