Total-chromatic Number on Graphs P_m×P_n and P_m×C_n
Chen Li · Journal of Gansu Sciences · 2005
Assume that P_m=u_1u_2...u_m, C_n=ν_1ν_2...ν_nν_1, the definition of the graph P_m×C_n,(m≥2, n≥3) is that V(P_m×C_n)={w_(ij)|i=1,2,...,m;j=1,2,...,n},E(P_m×C_n)={w_(ij)w_(rs)|w_(ij),w__(rs)∈V(P_m×C_n), and i=r,ν_jν_s∈E(C_n) or j=s,ν_i ν_r∈E(P_m)}. Hence, the total-chromatic number of P_2×C_5 is obtained.