禹继国,王光辉,刘桂真.系列平行图的围长和圆可选性[J].数学研究及应用,2006,26(3):495~498 |
系列平行图的围长和圆可选性 |
Girth and Circular Choosability of Series-Parallel Graphs |
投稿时间:2005-03-31 |
DOI:10.3770/j.issn:1000-341X.2006.03.010 |
中文关键词: 圆可选性 平面图 围长. |
英文关键词:circular choosability, planar graph, girth. |
基金项目:The National Natural Science Foundation of China (10471048), RFDP (20040422004) of Higher Education, Promotional Foundation (2005BS01016) for Middle-aged or Young Scientists of Shandong Province, and DRF of QFNU. |
|
摘要点击次数: 3016 |
全文下载次数: 2523 |
中文摘要: |
本文讨论了系列平行图的圆可选性.令 $\chi_{c,l}$ 表示圆可选性(或圆列表着色数). 本文证明了围长至少是$4n+1$的系列平行图的圆可选性至多为$2+1/n$. |
英文摘要: |
This paper discusses a circular version of choosability of series-parallel graphs. Let $\chi_{c,l}$ denote the circular choosability (or the circular list chromatic number). This paper proves that serial-parallel graphs of girth at least $4n+1$ have circular choosability at most $2+1/n$. |
查看全文 查看/发表评论 下载PDF阅读器 |