放松对策色数为3且结构简单的树  

Trees with More Simple Structure and Relaxed Game Chromatic Number 3

作　　者：沈邦玉[1] 

机构地区：[1]淮阴师范学院数学系,江苏淮安223300

出　　处：《淮阴师范学院学报（自然科学版）》2006年第2期102-104,共3页Journal of Huaiyin Teachers College;Natural Science Edition

摘　　要：讨论了图上的二人对策着色和放松对策着色.给出了放松对策色数能够达到树族放松对策色数最大值且结构非常简单的树.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.

关 键 词：对策着色 放松对策着色 可行色 对策色数 放松对策色数 树 二叉正则树 

分 类 号：O157.5[理学—数学]