The equitable total coloring of a graph G is a total coloring such that the numbers of elements in any two colors differ by at most one.The smallest number of colors needed for an equitable total coloring is called the equitable total chromatic number.This paper contributes to the equitable total coloring of Fibonacci graphs F△,n.We determine the equitable total chromatic numbers of F△,n for △=3,4,5 and propose a conjecture on that for △＞=6.
Fibonacci graphequitable total coloringequitable total chromatic number
Yong LI、Chunling TONG、Senyuan SU、Yanan SU
展开 >
School of Information Science and Electricity Engineering,Shandong Jiaotong University,Shandong 250357,P.R.China
Department of Mathematics,Simon Fraser University,BC V5A 1S6,Canada
National Natural Science Foundation of ChinaNatural Science Foundation of Shandong Province
NETL
NSTL
万方数据
