几种图的对策着色和对策色数  

The Game Chromatic and Chromatic Number of Several Graphs

作　　者：江燕[1] 杨帆[1] 

机构地区：[1]华中师范大学数学与统计学学院,湖北武汉430079

出　　处：《云南民族大学学报（自然科学版）》2007年第4期311-313,共3页Journal of Yunnan Minzu University:Natural Sciences Edition

摘　　要：介绍了一种新的色对策和对策色数,比较了2种色对策的差异.对几种特殊的图形的色对策数进行了讨论,运用顶点标号方法,给出获胜策略.This paper introduces a new game coloring chromatic number and compares the differenes between the two kinds of chromatic numbers. By labeling the vertex of graph,this paper determines the chromatic number of several graphs.

关 键 词：顶点着色 对策着色 对策色数 

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