Hits :

First Author : Qiaojun Shu

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.23

Issue : No.1

Page Number : 140-157

ISSN : 1382-6905

Translation or Not : no

Key Words : Acyclic;edge;coloring;Planar;graph;Girth;Maximum;degree

Abstract : An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a′(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. In this paper, we prove