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
Analysis of a heuristic for acyclic edge colouring
Information Processing Letters
Acyclic edge colorings of graphs
Journal of Graph Theory
Acyclic Edge Colouring of Outerplanar Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
About acyclic edge colourings of planar graphs
Information Processing Letters
Graph Theory
Some results on acyclic edge coloring of plane graphs
Information Processing Letters
Random Structures & Algorithms
| Hi-index | 0.89 |
Let c be a proper edge coloring of a graph G. If there exists no bicolored cycle in G with respect to c, then c is called an acyclic edge coloring of G. Let G be a planar graph with maximum degree @D and girth g. In Dong and Xu (2010) [8], Dong and Xu proved that G admits an acyclic edge coloring with @D(G) colors if @D=8 and g=7, or @D=6 and g=8, or @D=5 and g=9, or @D=4 and g=10, or @D=3 and g=14. In this note, we fix a small gap in the proof of Dong and Xu (2010) [8], and generalize the above results to toroidal graphs.