Acta Scientiarum Naturalium Universitatis Pekinensis

Previous Articles     Next Articles

On the Maximum Average Degree and the Incidence Chromatic Number

WANG Shudong1,2 YAN Lijun LIU Xiangrong   

  1. 1Institute of Software,School of Electronic Engineering and Computer Science,Peking University,Beijing 100871; 2College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510;
  • Received:2007-09-06 Online:2008-09-20 Published:2008-09-20

图的最大平均度与关联色数

王淑栋1,2,闫立军2,刘向荣1   

  1. 1北京大学信息科学技术学院软件所,北京100871;2山东科技大学信息科学与工程学院,青岛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

Key words: graph, incidence coloring, incidence chromatic number, maximum average degree

摘要: 图G的关联着色是从关联集I(G)到颜色集C的一个映射使得任意两个相邻的关联不着同色。从图的结构性质出发,对图的关联着色进行了讨论,利用归纳法和换色技巧证明了mad(G)<3,Δ(G)=4的图G存在一个(6,2)-关联着色。

关键词: 图, 关联着色, 关联色数, 最大平均度

CLC Number: