期刊文献+

图的邻点可区别无圈边染色的一个界 被引量:8

A BOUND OF ADJACENT VERTEX-DISTINGUISHING ACYCLIC EDGE COLORING OF GRAPHS
原文传递
导出
摘要 图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.
  • 相关文献

参考文献9

  • 1Alon N, McDiarmid C J H and Reed B A. Acyclic coloring of graphs. Random Structures and Algorithms, 1991, 2: 277-288.
  • 2Alon N, Sudakov B, Zaks A. Acyclic edge colorings of graphs. 2002 John Wiley & Sons, Inc. J. Graph Theory, 2001, 37(3): 157-167.
  • 3Hatami H. △+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. of Combinatorial Theory (Series B), 2005, 95: 246-256.
  • 4Zhang Z F, Liu L Z, Wang J F. Adjacent strong edge coloring of graphs. Applied Mathematics Letters, 2002, 15: 623-626.
  • 5Molloy M, Reed B. Graph Coloring and the Probabilistic Method. Berlin, Spring, 2002.
  • 6Alon N, Spencer J H. The Probabilistic Method. New York, Wiley, 1992.
  • 7Michael Krivelevich, Asaf Nachmias. Coloring complete bipartite graphs from random lists. Random Structures and Algorithms, 2006, 29: 436-449.
  • 8Alon N, Sudakov B, Zaks A. Acyclic edge colorings of graphs. 2002 John Wiley & Sons, Inc. J. Graph Theory, 2001, 37(3): 157-167.
  • 9Alon N, Zaks A. Algorithmic aspects of acyclic edge colorings. Algorithmica, 2002, 32: 611-614.

同被引文献28

  • 1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:174
  • 2ZHANG ZhongFu,CHENG Hui,YAO Bing,LI JingWen,CHEN XiangEn,XU BaoGen.On the adjacent-vertex-strongly-distinguishing total coloring of graphs[J].Science China Mathematics,2008,51(3):427-436. 被引量:79
  • 3张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报(中文版),2006,49(3):703-708. 被引量:96
  • 4Jing-wen Li,Zhong-fu Zhang,Xiang-en Chen,Yi-rong Sun.A Note on Adjacent Strong Edge Coloring of K(n,m)[J].Acta Mathematicae Applicatae Sinica,2006,22(2):273-276. 被引量:13
  • 5张忠辅,李敬文,陈祥恩,姚兵,王文杰,仇鹏翔.图的距离不大于β的点可区别的全染色[J].中国科学(A辑),2006,36(10):1119-1130. 被引量:72
  • 6FERTIN G, RASPAUD A, REED B. Star coloring ofgraphs[J] Graph Theory, 2004, 47(3): 163- 182.
  • 7HATAMI H. A +300 is a bound on the adjacent vertex distinguishing edge chromatic number[J]. Journal of Combinatorial Theory : Series B, 2005, 95: 246-256.
  • 8TIAN Jing-jing, LIU Xin-sheng, ZHANG Zhong-fu,et al. Upper bounds on the D(β)-vertex-distinguishing edge-chromatic numbers of graphs E C]//Lecture Notes in Computer Science 4489. Berlin.. Springer, 2007: 453-456.
  • 9ZHANG Zhong-fu, IAU Lin-zhong, WANG Wei-fan. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15: 623-626.
  • 10ALON S B, ZAKS A. Acyclic edge coloring of graphs [ J ]. Journal of Graph Theory, 2001, 37(3): 157-167.

引证文献8

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部