Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Acyclic colorings of subcubic graphs
Information Processing Letters
Acyclic edge colorings of graphs
Journal of Graph Theory
Acyclic edge coloring of graphs with maximum degree 4
Journal of Graph Theory
Random Structures & Algorithms
Improved bounds on coloring of graphs
European Journal of Combinatorics
Acyclic edge coloring of planar graphs without 5-cycles
Discrete Applied Mathematics
Acyclic edge colouring of plane graphs
Discrete Applied Mathematics
A new upper bound on the acyclic chromatic indices of planar graphs
European Journal of Combinatorics
Acyclic edge coloring of graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
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. Fiamcik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that a^'(G)@?@D+2 for any simple graph G with maximum degree @D. In this paper, we show that if G is a planar graph without a 3-cycle adjacent to a 4-cycle, then a^'(G)@?@D+2, i.e., this conjecture holds.