JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2014, Vol. 49 ›› Issue (2): 18-23.doi: 10.6040/j.issn.1671-9352.0.2013.103

• Articles • Previous Articles     Next Articles

Acyclic list edge coloring of planar graphs with girth #br# ≥ 11 and maximum degree 3

MA Gang   

  1. School of Science, Shandong University of Technology, Zibo 255049, Shandong, China
  • Received:2013-03-07 Online:2014-02-20 Published:2014-06-04

PDF (PC)

757

Abstract:

Let G be a planar graph with maximum degree 3. It is proved that the acyclic list edge coloring of G is 3 if its girth is at least 11.

Key words: girth, planar graphs, acyclic list edge coloring

CLC Number: 

  • O157.5
[1] ZHU Hai-yang, GU Yu, LÜ Xin-zhong. New upper bound on the chromatic number of the square of a planar graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(2): 94-101.
[2] DING Wei. Acyclic edge coloring of planar graphs without 4-Cycles [J]. J4, 2012, 47(6): 76-79.
[3] ZHU Hai-yang1, HOU Li-feng1, CHEN Wei1, Lü Xin-zhong2. The L(p,q)-labeling of planar graphs with girth g(G)≥5 [J]. J4, 2011, 46(8): 95-103.
[4] ZHU Hai-yang1, L Xin-zhong2, SHENG Jing-jun1, HANG Dan3 . The L(p,q)-labeling of planar graphs with girth g(G)≥6 [J]. J4, 2011, 46(4): 9-16.
[5] LI Shuo,LI Feng,LIANG Feng . The heterochromatic girth in edge-colored graphs [J]. J4, 2008, 43(6): 19-20 .
[6] ZHU Xiao-ying,XU Yang,SHI Hong-jun . The 3-choosability of plane graphs without3-， 6-,9- and 10-cycles [J]. J4, 2007, 42(10): 59-62 .
[7] YUAN Chun-hua,FENG Li-hua,XING Shun-lai . Some remarks on the bondage number of graphs [J]. J4, 2006, 41(4): 25-27 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd