×

Acyclic edge colorings of planar graphs without 5-cycles. (Chinese. English summary) Zbl 1274.05180

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
PDFBibTeX XMLCite