%0 Journal Article
%T 一类平面图的强边染色<br>Strong edge coloring of a class of planar graphs
%A 孟献青
%J 山东大学学报（理学版）
%D 2015
%R 10.6040/j.issn.1671-9352.0.2015.165
%X 摘要： 图G的强边染色是指对图G的边进行染色,使得距离不超过2的任意两条边染不同的颜色. 任何一个平面图都可用4Δ+4种颜色进行强边染色. 证明了当平面图没有k-圈(4≤k≤10)且3-圈不相交时(即每个顶点至多关联一个3-圈), 必定存在一个3Δ+1种颜色的强边染色.<br>Abstract: A strong edge coloring of a graph G is an assignment of colors to the edges of the graph such that any two edges at distance at most 2 receive distinct colors. It is known that every planar graph has a strong edge-coloring with at most 4Δ+4 colors. It is proved that planar graph G has a strong edge-coloring with at most 3Δ+1 colors if G has no k-cycles with 4≤k≤10 and no intersecting 3-cycles (that is, every vertex is incident with at most one cycle of length 3)
%K 平面图
%K 强边染色
%K 强边色数
%K 圈
%K &lt
%K br&gt
%K planar
%K cycle
%K srtong chromaic index
%K strong edge coloring
%U http://lxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1671-9352.0.2015.165