An acyclic edge coloring of Graph G is a proper edge coloring without bichromatic cycles.The acyclic edge chromatic number of a graph G,denoted by …
参考文献
相似文献
引证文献
引用本文
杨文娟,谢德政.平面图无圈边着色的一个结果[J].重庆工商大学学报(自然科学版),2012,29(4):17-19 YANG Wen-juan, XIE De-zheng. A Result from Acyclic Edge Coloring of Plane Graphs[J]. Journal of Chongqing Technology and Business University(Natural Science Edition),2012,29(4):17-19