Hits :

First Author : Qiaojun Shu

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.160

Issue : No.7-8

Page Number : 1211-1223

ISSN : 0166-218X

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. Fiamčik (1978) [9] an