Generalized Petersen graphs P(n,k)are the most widely studied in coloring problems.However,the total chromatic number of P(n,k)for k(mod 4)=0 needs to be further studied.By combining computer searching and mathematics techniques,the equitable total chromatic number of P(n,k)for k(mod16)=4,8,12 and k(mod 16)=0 ∧ n(mod 2k)=0,1,2,4 are obtained.
generalized Petersen graphequitable total coloringequitable total chromatic number
NETL
NSTL
万方数据
