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

单圈图和双圈图的动态色数
引用本文:秦健,张岩. 单圈图和双圈图的动态色数[J]. 山东大学学报(理学版), 2007, 42(10): 37-40
作者姓名:秦健  张岩
作者单位:中国矿业大学,理学院数学系,江苏,徐州,221008;中国矿业大学,理学院数学系,江苏,徐州,221008
摘    要:在对单圈图的性质进行分析的基础上,证明了单圈图的动态色数是3或4.构造了双圈图的子图H1和H2,证明了大部分双圈图的动态色数χd(G)=max{χd(H1),χd(H2)}.并给出了一个动态色数不是max{χd(H1),χd(H2)}的双圈图.

关 键 词:单圈图  双圈图  动态染色  色数
文章编号:1671-9352(2007)10-0037-04
修稿时间:2007-05-12

Dynamic chromatic number of unicyclic graphs and bicyclic graphs
QIN Jian,ZHANG Yan. Dynamic chromatic number of unicyclic graphs and bicyclic graphs[J]. Journal of Shandong University, 2007, 42(10): 37-40
Authors:QIN Jian  ZHANG Yan
Affiliation:School of Science, China University of Mining and Technology, Xuzhou 221008, Jiangsu, China
Abstract:The dynamic chromatic number of unicyclic graphs is proved to be 3 or 4 based on the analysis of the property of unicyclic graphs. Then the dynamic chromatic number of most bicyclic graphs is proved to be χd(G)=max{χd(H1),χd(H2)} after the subgraphs H1 and H2 of bicyclic graphs are structured. At last, a bicyclic graph, is given whose dynamic chromatic number is not max{χd(H1),χd(H2)}.
Keywords:unicyclic graphs   bicyclic graphs   dynamic coloring   chromatic number
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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