一类特殊图的顶点染色数 |
| |
引用本文: | 张祥波.一类特殊图的顶点染色数[J].安庆师范学院学报(自然科学版),2015(3). |
| |
作者姓名: | 张祥波 |
| |
作者单位: | 临盘中学,山东 临邑,251507 |
| |
摘 要: | 如果图G含有的所有最大团存在公共顶点,且公共顶点的个数为κ,就称此图为第κ类图。据此,本文给出了研究图的顶点染色的一种新方法,并以此研究了一类特殊图的顶点染色及一些图的顶点染色数。
|
关 键 词: | 最大团 顶点染色数 第k类图 图的厚度 |
A Class Vertex Coloring Number of Special Graphs |
| |
Abstract: | 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. |
| |
Keywords: | the maximum clique vertex coloring number first k class of graph thickness of a graph |
本文献已被 CNKI 万方数据 等数据库收录! |
|