欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
图的一个正常的全染色如果满足不同点的点及其关联边的色集合不同,则称该染色法为点可区别全染色,其所用最少颜色数称为该图的点可区别全色数.给出了完全二部图的Mycielski图的点可区别全色数.
英文摘要：
A proper total coloring of a graph is called vertex-distinguishing total coloring if any two vertices have different color sets,where the color set of a vertex is the set composed of all colors of the vertex and the edges incidental to it. The minimum number of colors of a vertex-distinguishing total coloring is called the vertex-distinguishing total chromatic number of the graph. In this paper, we obtained the vertex-distinguishing total chromatic number of Mycielski＇s graph of complete bipartite graph.
同期刊论文项目
同项目期刊论文
期刊信息
位置：