苏州科技学院学报（自然科学版）Issue(2)：17-26,40,11.
最大度至少为9的平面图的弱邻点可区别边色数
Weak adjacent vertex distinguishing edge-colorings of planar graphs with △≥9
摘要
Abstract
This paper introduces a type of adjacent vertex distinguishing edge-coloring,weak adjacent vertex distinguish- ing edge-oloring. The weak adjacent vertex distinguishing edge-coloring of graph G is a proper edge-coloring of G such that any pair of adjacent △-vertices u and v see distinct sets of colors. The minimum number of colors required for a weak adjacent vertex distinguishing edge-coloring of G is denoted by x′a△(G). We prove that if G is a planar graph with △≥9, then x′a△(G)≤△+2.关键词
弱邻点可区别边染色/邻点可区别边染色/平面图/最大度Key words
weak adjacent vertex distinguishing edge-coloring/adjacent vertex distinguishing edge-coloring/planar graph/maximum degree分类
数理科学引用本文复制引用
严丞超,黄丹君..最大度至少为9的平面图的弱邻点可区别边色数[J].苏州科技学院学报（自然科学版）,2014,(2):17-26,40,11.基金项目
浙江省自然科学基金资助项目（LQ13A010009）；浙江省教育厅基金资助项目 （）
