| 关于图全着色的几个结果 |
| |
| 引用本文： | 刘家壮,胡代强. 关于图全着色的几个结果[J]. 山东大学学报(理学版), 1994, 0(4) |
| |
| 作者姓名： | 刘家壮 胡代强 |
| |
| 作者单位： | Dept.of Math.，Shandong Univ.，Jinan |
| |
| 摘 要： | 引入了一种研究图全着色问题的新方法，即从考虑图中的圈出发研究全着色问题．运用该方法确定了一些图的全色数，并给出了图全色数的一个上界．
|
| 关 键 词： | 图；全色数；圈秩 |
SOME RESULTS ON THE TOTALCOLORING OF GRAPHS |
| |
| Liu Jiazhuang,Hu Daiqiang. SOME RESULTS ON THE TOTALCOLORING OF GRAPHS[J]. Journal of Shandong University, 1994, 0(4) |
| |
| Authors: | Liu Jiazhuang Hu Daiqiang |
| |
| Abstract: | A new method is introcuced to study the total coloring problem of graphs. By considering cycles of graphs,the total chromatic number of some graphs are determined,and an upper bound of the total chromatic number of graphs is given. |
| |
| Keywords: | graph total chromatic number cycle rank |
| 本文献已被 CNKI 等数据库收录！ |
