首页 | 本学科首页   官方微博 | 高级检索  
     

系列平行图的围长和圆可选性
引用本文:禹继国,王光辉,刘桂真. 系列平行图的围长和圆可选性[J]. 数学研究及应用, 2006, 26(3): 495-498
作者姓名:禹继国  王光辉  刘桂真
作者单位:1. 曲阜师范大学计算机科学学院,山东,日照,276826
2. 山东大学数学与系统科学学院,山东,济南,250100
基金项目: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.
摘    要:本文讨论了系列平行图的圆可选性.令x_(c,l)表示圆可选性(或圆列表着色数).本文证明了围长至少是4n 1的系列平行图的圆可选性至多为2 1/n.

关 键 词:圆可选性  平面图  围长
文章编号:1000-341X(2006)03-0495-04
收稿时间:2005-03-31
修稿时间:2005-03-31

Girth and Circular Choosability of Series-Parallel Graphs
YU Ji-guo,WANG Guang-hui and LIU Gui-zhen. Girth and Circular Choosability of Series-Parallel Graphs[J]. Journal of Mathematical Research with Applications, 2006, 26(3): 495-498
Authors:YU Ji-guo  WANG Guang-hui  LIU Gui-zhen
Affiliation:School of Computer Science, Qufu Normal University at Rizhao, Shandong 276826, China;School of Mathematics and System Science, Shandong University, Ji'nan 250100, China;School of Mathematics and System Science, Shandong University, Ji'nan 250100, China
Abstract:This paper discusses a circular version of choosability of series-parallel graphs. Let x_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.
Keywords:circular choosability  planar graph  girth.
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号