%0 Journal Article
%T A Bound of Adjacent Vertex-Distinguishing Acyclic Edge Coloring of Graphs<br>图的邻点可区别无圈边染色的一个界
%A QIANG Huiying
%A LI Muchun
%A ZHANG Zhongfu
%A <br>强会英
%A 李沐春
%A 张忠辅
%J 系统科学与数学
%D 2008
%I 
%X 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, whereuv\in 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.
%K Adjacent vertex distinguishing acyclic edge coloring of graphs
%K adjacent strong edge coloring of graphs
%K acyclic edge coloring of graphs
%K Lovasz local lemma<br>邻点可区别无圈边染色
%K 邻强边染色
%K 无圈边染色
%K Lovász局部引理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=ADB082228C34F98E22E3E583FD8D51F3&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=7B747CE18E2C7596&eid=2E45C5B3364EA9F3&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=9