论文部分内容阅读
A proper edge coloring of a graph is acyclic, if every cycle of the graph has at least 3 colors. Let r be a positive integer. An edge coloring is r-acyclic if it is proper and every cycle C has at least ?colors. The r-acyclic edge chromatic ??number of a