Acyclic Edge Colorings of Special Cartesian Products of Graphs
Tian Shuang-liang · 2012
In this paper,it studied the acyclic edge coloring on the Cartesian product of simple graphs,and the minimum acyclic edge chromatic number(denoted by).By means of graph decomposition and the method of constructing,we give the acyclic edge chromatic number of the Cartesian product G×H,4G×C4,T1×T2×…×Tn,Qn,and so on.