| 图的最大平均度与关联色数 |
| |
| 引用本文： | 王淑栋,闫立军,刘向荣.图的最大平均度与关联色数[J].北京大学学报(自然科学版),2008,44(5):727. |
| |
| 作者姓名： | 王淑栋 闫立军 刘向荣 |
| |
| 作者单位： | 北京大学信息科学技术学院软件所，北京100871;山东科技大学信息科学与工程学院,青岛266510; |
| |
| 基金项目： | 国家自然科学基金，中国博士后科学基金 |
| |
| 摘 要： | 图G的关联着色是从关联集I(G)到颜色集C的一个映射使得任意两个相邻的关联不着同色。从图的结构性质出发,对图的关联着色进行了讨论，利用归纳法和换色技巧证明了mad(G)<3,Δ(G)=4的图G存在一个(6,2)-关联着色。
|
| 关 键 词： | 图 关联着色 关联色数 最大平均度 |
| 收稿时间： | 2007-09-06 |
On the Maximum Average Degree and the Incidence Chromatic Number |
| |
| WANG Shudong,YAN Lijun,LIU Xiangrong.On the Maximum Average Degree and the Incidence Chromatic Number[J].Acta Scientiarum Naturalium Universitatis Pekinensis,2008,44(5):727. |
| |
| Authors: | WANG Shudong YAN Lijun LIU Xiangrong |
| |
| Institution: | Institute of Software,School of Electronic Engineering and Computer Science,Peking University,Beijing 100871; College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510; |
| |
| Abstract: | An incidence coloring of graph G is a mapping from the incidence set I(G) to color set C such that any two neighborly incidences are assigned different colors. The authors discussed incidence coloring of graph and proved graph G with mad(G)<3,(G)=4 to admit a (6,2)-incidence coloring by the induction and the exchanging colors method from the aspect of configuration property. |
| |
| Keywords: | graph incidence coloring incidence chromatic number maximum average degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《北京大学学报(自然科学版)》下载免费的PDF全文 |
