| The Criticality for Circular Coloring of Graph |
| |
| 作者姓名： | 闫晓霞 赵浩 |
| |
| 作者单位： | Dept. of Math., Shandong Univ., Jinan, Shandong, 250100, P. R. China |
| |
| 基金项目： | The work is supported by NSFC (No. 60172003) and Natural Science Foundation of Shandong Province (No.Z2000A02). |
| |
| 摘 要： | For two positive integers k and d such that k ≥ 2d, Gkd is the graph with vertex set{0,1,…,k-1} in which ij is an edge if and only ifd ≤ |i-j|≤ k-d. Clearly, Gk1 is acomplete graph of k vertices and we always assume d ≥ 2 in the following.
|
| 关 键 词： | 图 圆染色 临界性 圆色数 |
| 修稿时间： | 2002年5月7日 |
The Criticality for Circular Coloring of Graph Gkd |
| |
| Abstract: | For two positive integers k and d such that k ≥ 2d, Gkd is the graph with vertex set{0,1,…,k-1} in which ij is an edge if and only ifd ≤ |i-j|≤ k-d. Clearly, Gk1 is acomplete graph of k vertices and we always assume d ≥ 2 in the following. |
| |
| Keywords: | |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
