摘要
如果图G含有的所有最大团存在公共顶点,且公共顶点的个数为κ,就称此图为第κ类图。据此,本文给出了研究图的顶点染色的一种新方法,并以此研究了一类特殊图的顶点染色及一些图的顶点染色数。
If there are common vertexes in all the maximum cliques of graph, and there are k common vertexes, then we call graph is the k class graph. Hereby, this paper gives a new method to study vertex coloring of graph. According to this method, this paper studies a class vertex coloring of special graphs, and gives vertex coloring number of some graphs.
出处
《安庆师范学院学报（自然科学版）》
2015年第3期11-13,30,共4页
Journal of Anqing Teachers College(Natural Science Edition)
关键词
最大团
顶点染色数
第κ类图
图的厚度
the maximum clique, vertex coloring number, first k class of graph, thickness of a graph
