| Halin图的一个点强全染色法 |
| |
| 引用本文： | 田宝玉,王燕,王科伦.Halin图的一个点强全染色法[J].大连海事大学学报(自然科学版),2006,32(1):107-110. |
| |
| 作者姓名： | 田宝玉 王燕 王科伦 |
| |
| 作者单位： | 大连海事大学,数学系,辽宁,大连,116026;大连海事大学,数学系,辽宁,大连,116026;大连海事大学,数学系,辽宁,大连,116026 |
| |
| 摘 要： | 针对Halin图的点强全染色问题,提出一个有效的染色法———逐圈着色法,而且方法给出的方案也是最优的,即用最少的颜色完成Halin图的点强全染色.同时还确定了最大顶点度是3的Halin图的点强全色数的上下界,即上界为6,下界为5.
|
| 关 键 词： | Halin图 强染色 点强全染色 逐圈着色法 |
| 文章编号： | 1006-7736(2006)01-0107-04 |
| 收稿时间： | 2005-10-25 |
| 修稿时间： | 2005年10月25 |
Method on vertex strong total coloring of Halin graphs |
| |
| TIAN Bao-yu,WANG Yan,WANG Ke-lun.Method on vertex strong total coloring of Halin graphs[J].Journal of Dalian Maritime University,2006,32(1):107-110. |
| |
| Authors: | TIAN Bao-yu WANG Yan WANG Ke-lun |
| |
| Institution: | Math. Dept., Dalian Maritime Univ., Dalian 116026, China |
| |
| Abstract: | An effective coloring method was given on the problem of vertex strong total coloring of Halin Graphs constructively-the method of coloring cycles one by one is proposed,which is evaluated as the best one.Namely,using the least number of colors,it is possible to finish the vertex strong total coloring of Halin Graphs.Meanwhile,the bounds of the vertex strong total chromatic number of Halin graphs with maximum degree 3 were given.The upper bound and the lower bound are 6 and 5,respectively. |
| |
| Keywords: | Halin graph strong coloring vertex strong total coloring method of coloring cycles one by one |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
