平面图的全染色的一个结果
result on total coloring of planar graphs
图G的一个k-全染色是用k种颜色对图G的顶点集和边集进行染色使得相邻接的或相关联的元素染不同的颜色，图G的全色数χ\"（G）为图G的k-全染色中的最小k值．Behzad和Vizing 猜想任意简单图G的全色数都不超过Δ(G)+5
total k-coloring of a graph G is a coloring of V（G)∪E(G) using k colors such that no two adjacent or incident elements get the same color. The total chromatic number of G, denoted by χ\"(G), is the smallest integer k such that G has a total k-coloring. Behzad and Vizing conjectured that the total chromatic number of any graphΔ(G)+5
陈晓杰、张埂、丁伟、段娟娟
数学
全染色平面图全色数
total coloringplanar graphtotal chromatic number
陈晓杰,张埂,丁伟,段娟娟.平面图的全染色的一个结果[EB/OL].(2010-08-10)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201008-143.点此复制
评论