The edge chromatic number and adjacent strong edge chromatic number of F_m▽F_n
Chuancheng Zhao · Journal of Foshan University · 2005
V(F_mF_n)=｛w｝∪｛u_i｜i=1,2,…,m｝∪｛v_(ij)｜i=1,2,…,m;j=1,2,…,n｝,E(F_mF_n)=｛wu_i｜i=1,2,…,m｝∪｛u_iv_(ij)｜i=1,2,…,m,j=1,2,…,n｝∪｛u_iu_(i+1)｜i=1,2,…,m-1｝∪｛v_(ij)v_i(j+1)｜i=1,2,…,m;j=1,2,…,n-1｝.The mapping f is proper edge coloring of G, if e∈E(G),e=uv,｛f(uw)｜uw∈E(G)｝≠｛f(uw)｜uw∈E(G)｝,f is called adjacent strong k-edge coloring, the maximum k is called adjacent strong edge chromatic number of G.