|
|||||
|
|
| 色数等于选择数的4-正则图 | |
| 引用本文： | 卜月华,王维凡. 色数等于选择数的4-正则图[J]. 运筹学学报, 2006, 10(2): 69-74 |
| 作者姓名： | 卜月华 王维凡 |
| 作者单位： | 上海大学数学系,上海,200444;浙江师范大学数学系,金华,321004 |
| 基金项目： | Research supported partially by NSFC(No．10471131)ZJNSF(No．M103094,No．Y604167)． |
| 摘 要： | 设Hn(n≥5)表示一个图:以1,2,．．．,n为顶点,两个点i和j是相邻的当且仅当|i-j|≤2,其中加法取模n．这篇文章证明了,Hn的色数等于它的选择数．结果被用于刻画最大度至多2的图的列表全色数． |
| 关 键 词： | 运筹学 正则图 色数 选择数 |
| 收稿时间： | 2004-06-25 |
| 修稿时间： | 2004-06-25 |
Chromatic-Choosable 4-Regular Graphs |
|
| Bu Yuehua,Wang Weifan. Chromatic-Choosable 4-Regular Graphs[J]. OR Transactions, 2006, 10(2): 69-74 | |
| Authors: | Bu Yuehua Wang Weifan |
| Affiliation: | 1.Department of Mathematics, Shanghai University, Shanghai 200444, China;2.Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China |
| Abstract: | A graph is chromatic-choosable if its choice number coincides with its chromatic number. Let Hn (n ≥ 5) denote the graph with vertices 1, 2,…, n and two vertices i and j being adjacent if and only if |i-j| ≤ 2, where addition is taken modulo n. In this paper we prove that Hn is chromatic-choosable. The result is applied to characterize the list total chromatic number of graphs with maximum degree at most two. |
| Keywords: | Operation research regular graph chromatic number choice number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |