Hits :

First Author : Weifan Wang

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

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : European Journal of Combinatorics

Volume: Vol.34

Issue : No.2

Page Number : 338-354

ISSN : 0195-6698

Translation or Not : no

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. It was conjectured that