| 几种图的对策着色和对策色数 |
| |
| 引用本文： | 江燕,杨帆. 几种图的对策着色和对策色数[J]. 云南民族大学学报(自然科学版), 2007, 16(4): 311-313 |
| |
| 作者姓名： | 江燕 杨帆 |
| |
| 作者单位： | 华中师范大学,数学与统计学学院,湖北武汉430079 |
| |
| 摘 要： | 介绍了一种新的色对策和对策色数,比较了2种色对策的差异.对几种特殊的图形的色对策数进行了讨论,运用顶点标号方法,给出获胜策略.
|
| 关 键 词： | 顶点着色 对策着色 对策色数 |
| 文章编号： | 1672-8513（2007）04-0311-03 |
| 收稿时间： | 2007-05-30 |
| 修稿时间： | 2007-05-30 |
The Game Chromatic and Chromatic Number of Several Graphs |
| |
| Jiang Yan,Yang Fan. The Game Chromatic and Chromatic Number of Several Graphs[J]. Journal of Yunnan Nationalities University:Natural Sciences Edition, 2007, 16(4): 311-313 |
| |
| Authors: | Jiang Yan Yang Fan |
| |
| Affiliation: | School of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China |
| |
| Abstract: | 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. |
| |
| Keywords: | vertex coloring game chromatic game chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
