一种构造k-色临界图的方法 |
| |
作者姓名: | 李雪峰 |
| |
作者单位: | 西安邮电学院,陕西,西安,710121 |
| |
基金项目: | 国家自然科学基金,陕西省自然科学基金 |
| |
摘 要: | 图G的色数Х(G)是指对图G进行着色并使相邻顶点具有不同颜色的最少颜色数,若对G的任意真子图H有Х(H)〈Х(G)=k,则称G是k-色临界的,因此可以给出一种构造k-色临界图的方法。
|
关 键 词: | 可k-着色 色数 临界图 |
One Means of Constructing K-Chromatically Critical Graphs |
| |
Authors: | LI Xue-feng |
| |
Institution: | LI Xue-feng |
| |
Abstract: | The chromatic number Х(G) of graph G is the least color number k if its vertices can be colored with k colors so that no two adjacent vertices have the same color. G is said to be k - critical graph if Х(H) 〈 Х(G) = k for every proper subgraph H of G. In this paper, one means of constructing k - chromatically critical graphs is gived. |
| |
Keywords: | k - colorable chromatic number critical graph |
本文献已被 维普 万方数据 等数据库收录! |
|