摘要
图G的一个正常边染色被称作邻点可区别无圈边染色,如果G中无二色圈,且相邻点关联边的色集合不同.应用概率的方法得到了图G的一个邻点可区别无圈边色数的上界,其中图G为无孤立边的图.
A proper edge coloring of the graph G is called adjacent vertex distinguishing acyclic edge coloring, if there is no 2-colored cycle in G, and the coloring set of edges incident to u is not equal to the coloring set of edges incident to v, where uv∈E(G). In this paper, a new upper bound of adjacent vertex distinguishing acyclic edge coloring of the graph G with no isolated edges is obtained by the way of probability.
出处
《系统科学与数学》
CSCD
北大核心
2008年第10期1181-1186,共6页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(10771091)
甘肃省教委基金(0604-05)资助项目
关键词
邻点可区别无圈边染色
邻强边染色
无圈边染色
Lovasz局部引理
Adjacent vertex distinguishing acyclic edge coloring of graphs, adjacent strongedge coloring of graphs, acyclic edge coloring of graphs, Lovasz local lemma.