On <i>r</i>-acyclic edge colorings of planar graphs

作     者：Zhang, Xin Wang, Guanghui Yu, Yong Li, Jinbo Liu, Guizhen 

作者机构：Shandong Univ Sch Math Jinan 250100 Peoples R China Xidian Univ Dept Math Xian 710071 Peoples R China China Univ Min & Technol Coll Sci Xuzhou 221116 Peoples R China 

出 版 物：《DISCRETE APPLIED MATHEMATICS》 (离散应用数学)

年 卷 期：2012年第160卷第13-14期

页      面：2048-2053页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Chinese Ministry of Education NSFC [10971121, 11026184, 11101243, 61070230] GIIFSDU [yzc10040, yzc11025] RFDP SRF for ROCS IIFSDU [2009hw001] 

主　　题：r-acyclic edge coloring Planar graph Series-parallel graph Outerplanar graph 

摘      要：A proper edge coloring of G is r-acyclic if every cycle C contained in G is colored with at least min{vertical bar C vertical bar, r} colors. The r-acyclic chromatic index of a graph, denoted by a(r) (G), is the minimum number of colors required to produce an r-acyclic edge coloring. In this paper, we study 4-acyclic edge colorings by proving that a(4) (G) = 4. (C) 2012 Elsevier B.V. All rights reserved.