摘要
设V(G)是图G的顶点集,p=︱V(G)︱是图G的顶点数,X(G)是图G的顶点染色数,θ(G)是图G的厚度,︱S︱为图G最大团的顶点数.证明了在三种情况:(1)若图G是完全图;(2)︱S︱=p-1;(3)︱S︱=p-2下,皆有X(G)≤4θ(G)+θ2(G)-1.
Let V(G) be a vertex set of graphG , p = /V(G)/ is the number of vertex, z(G)is the number of vertex coloring, 0(G)is thiekness of graph G, /S/ is the number of vertex of the maximum elique. Proved that in three eonditions: (1) the graphGiseompletegraph; (2) /S/=p-1; (3) /S/=p-l, there isz(G)〈40(G)+θ(G)-I.
出处
《高师理科学刊》
2013年第5期35-37,共3页
Journal of Science of Teachers'College and University
关键词
图的色数
图的厚度
最大团
完全图
chromatic number of a graph
thickness of a graph
the maximum clique
complete graph