欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
图G的一个正常全染色f称为是邻点可区别的,如果G中任何相邻点的点及其关联边的颜色集合不同。对一个图G进行邻点可区别的正常全染色所用最少颜色数称为G的邻点可区别全色数,记为χat（G）。证明了χat（G）≤Δ（G）＋2对任意的Δ（G）≥11且围长至少为4的平面图G成立。
英文摘要：
A proper total coloring of G is an adjacent vertex distinguishing total coloring if for any two adjacent vertices,the sets of colors appearing on the vertex and incident edges are different.The smallest number of colors of which such a coloring of G exists is called the adjacent vertex distinguishing total chromatic number,and is denoted by χat（G）.It is proved that χat（G）≤Δ（G）＋2 for any planar bipartite graph G with maximum degree Δ（G） at least 11 and girth at least 4.
同期刊论文项目
同项目期刊论文
期刊信息
位置：