Acyclic edge coloring of planar graphs with girth at least 5

Authors:
Jianfeng Hou;Weitao Wang;Xiaoran Zhang
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 15
Cited 0

The cyclic coloring problem and estimation of spare hessian matrices

SIAM Journal on Algebraic and Discrete Methods
Acyclic and oriented chromatic numbers of graphs

Journal of Graph Theory
Further algorithmic aspects of the local lemma

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Acyclic edge colorings of graphs

Journal of Graph Theory
Star coloring of graphs

Journal of Graph Theory
Acyclic edge coloring of graphs with maximum degree 4

Journal of Graph Theory
Note: Acyclic edge coloring of planar graphs with large girth

Theoretical Computer Science
Acyclic edge chromatic number of outerplanar graphs

Journal of Graph Theory
Some results on acyclic edge coloring of plane graphs

Information Processing Letters
A parallel algorithmic version of the local lemma

Random Structures & Algorithms
Note: Improved bounds for acyclic chromatic index of planar graphs

Discrete Applied Mathematics
Acyclic chromatic indices of planar graphs with large girth

Discrete Applied Mathematics
Acyclic edge coloring of planar graphs with Δ colors

Discrete Applied Mathematics
Acyclic edge coloring of planar graphs without 5-cycles

Discrete Applied Mathematics
Optimal acyclic edge-coloring of cubic graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

A proper edge coloring of a graph G is acyclic if there is no bichromatic cycle in G. The acyclic chromatic index of G, denoted @g"a^'(G), is the least number of colors k such that G has an acyclic k-edge-coloring. In this paper, it is shown that if G is a planar graph with girth at least 5 and maximum degree @D, then @g"a^'(G)@?@D+1. Moreover, if @D=9, then @g"a^'(G)=@D.