Wu, Yanqing; Xie, Dezheng; Zhao, Canniao Acyclic edge colorings of planar graphs without 5-cycles. (Chinese. English summary) Zbl 1274.05180 Pure Appl. Math. 28, No. 3, 342-348 (2012). Summary: An acyclic edge coloring of a graph \(G\) is a proper edge coloring such that there are no bichromatic cycles. The acyclic edge chromatic number of a graph \(G\) is the least number of colors in an acyclic edge coloring of \(G\). In this paper, an upper bound on the acyclic edge chromatic number for planar graphs without 5-cycles is obtained using proof of contradiction. MSC: 05C15 Coloring of graphs and hypergraphs Keywords:acyclic edge coloring; acyclic edge chromatic number; planar graph PDFBibTeX XMLCite \textit{Y. Wu} et al., Pure Appl. Math. 28, No. 3, 342--348 (2012; Zbl 1274.05180)