图的最大平均度与关联色数(英文)

On the Maximum Average Degree and the Incidence Chromatic Number

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

An incidence coloring of graph G is a mapping from the incidence set Ⅰ （ 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.