| 外平面图的有界染色 |
| |
| 引用本文： | 战新刚,刘桂真.外平面图的有界染色[J].系统科学与数学,2005,25(5):582-587. |
| |
| 作者姓名： | 战新刚 刘桂真 |
| |
| 作者单位： | 山东大学数学与系统科学学院,济南,250100 |
| |
| 基金项目： | 国家自然科学基金(10471078)
高等学校博士点基金(20040422004)资助课题． |
| |
| 摘 要： | 图G的k-有界染色是图G的一个最多有k个顶点染同一种颜色的顶点染色．图 G的k-有界染色数Xk(G)是指对G进行k-有界染色用的最少颜色数．本文给出了n个顶点的外平面图能用n/k]种颜色k-有界染色的一些充分条件．
|
| 关 键 词： | 有界染色 有界染色数 外平面图 |
| 修稿时间： | 2003年5月26日 |
BONUNDED COLORINGS OF OUTERPLANAR GRAPHS |
| |
| Zhan Xingang,Liu Guizhen.BONUNDED COLORINGS OF OUTERPLANAR GRAPHS[J].Journal of Systems Science and Mathematical Sciences,2005,25(5):582-587. |
| |
| Authors: | Zhan Xingang Liu Guizhen |
| |
| Institution: | School of Mathematics and Systems Science, Shangdong University, Jinan} 250100 |
| |
| Abstract: | A fc-bounded vertex coloring of a graph G is a proper vertex coloring in which at most k vertices are colored with the same color. The fc-bounded chromatic number Xk(G) of a graph G is the smallest number of colors p such that G admits a fc-bounded coloring with p colors. In this paper, we provide some sufficient conditions for outerplanar graphs with n vertices to be fc-bounded colored with n/k] colors. |
| |
| Keywords: | Bounded vertex coloring bounded chromatic number outplanar graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
