@article {IOPORT.06093182,
    author       = {Xu, Yian},
    title        = {Acyclic edge coloring of triangle-free toroidal graphs.},
    year         = {2011},
    journal      = {Ars Combinatoria},
    volume       = {100},
    issn         = {0381-7032},
    pages        = {33-42},
    publisher    = {Charles Babbage Research Centre, Winnipeg, MB},
    abstract     = {Summary: A proper edge coloring $c$ of a graph $G$ is said to be acyclic if $G$ has no bicolored cycle with respect to $c$. It is proved that every triangle-free toroidal graph $G$ admits an acyclic edge coloring with $(\Delta (G)+5)$ colors. This generalizes a theorem from [Inf. Process. Lett. 110, No. 20, 887--892 (2010; Zbl 1234.05084)] of {\it W. Dong} and {\it B. Xu}.},
    identifier   = {06093182},
}