Abstract
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.
基金项目
National Natural Science Foundation of China(62072292)
Natural Science Foundation of Shandong Province(ZR2020KF010)