Hits :

First Author : Yiqiao Wang

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

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.161

Issue : No.16-17

Page Number : 2687–2694

ISSN : 0166-218X

Translation or Not : no

Key Words : _1">Keywords;Acyclic;edge;coloring;Planar;graph;Cycle;Maximum;degree

Abstract : 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 (19