| 放松对策色数为3且结构简单的树 |
| |
| 引用本文： | 沈邦玉.放松对策色数为3且结构简单的树[J].淮阴师范学院学报(自然科学版),2006,5(2):102-104. |
| |
| 作者姓名： | 沈邦玉 |
| |
| 作者单位： | 淮阴师范学院,数学系,江苏,淮安,223300 |
| |
| 摘 要： | 讨论了图上的二人对策着色和放松对策着色.给出了放松对策色数能够达到树族放松对策色数最大值且结构非常简单的树.
|
| 关 键 词： | 对策着色 放松对策着色 可行色 对策色数 放松对策色数 树 二叉正则树 |
| 文章编号： | 1671-6876（2006）02-0102-03 |
| 收稿时间： | 2005-11-22 |
| 修稿时间： | 2005年11月22 |
Trees with More Simple Structure and Relaxed Game Chromatic Number 3 |
| |
| SHEN Bang-yu.Trees with More Simple Structure and Relaxed Game Chromatic Number 3[J].Journal of Huaiyin Teachers College(Natrual Science Edition),2006,5(2):102-104. |
| |
| Authors: | SHEN Bang-yu |
| |
| Abstract: | This paper discusses the game coloring and relaxed game coloring on graphs.In this paper,we give a tree with more simple structure whose relaxed game chromatic number is equal to the maximum of the game chromatic number of forests. |
| |
| Keywords: | game coloring relaxed game coloring feasible color game chromatic number relaxed game chromatic number tree binary regular tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
