| 图的邻点可区别无圈边染色的一个界 |
| |
| 引用本文： | 强会英,李沐春,张忠辅.图的邻点可区别无圈边染色的一个界[J].系统科学与数学,2008,28(10):1181-1186. |
| |
| 作者姓名： | 强会英 李沐春 张忠辅 |
| |
| 作者单位： | 兰州交通大学数理与软件过程学院,甘肃,730070 |
| |
| 基金项目： | 国家自然科学基金，甘肃省教委基金 |
| |
| 摘 要： | 图G的一个正常边染色被称作邻点可区别无圈边染色,如果G中无二色圈,且相邻点关联边的色集合不同.应用概率的方法得到了图G的一个邻点可区别无圈边色数的上界,其中图G为无孤立边的图.
|
| 关 键 词： | 邻点可区别无圈边染色 邻强边染色 无圈边染色 Lovász局部引理 |
| 收稿时间： | 2007-4-10 |
A Bound of Adjacent Vertex-Distinguishing Acyclic Edge Coloring of Graphs |
| |
| QIANG Huiying,LI Muchun,ZHANG Zhongfu.A Bound of Adjacent Vertex-Distinguishing Acyclic Edge Coloring of Graphs[J].Journal of Systems Science and Mathematical Sciences,2008,28(10):1181-1186. |
| |
| Authors: | QIANG Huiying LI Muchun ZHANG Zhongfu |
| |
| Institution: | College of Mathematics, Physics and software Engineering, Lanzhou Jiaotong University, Lanzhou 730070 |
| |
| Abstract: | 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. |
| |
| Keywords: | Adjacent vertex distinguishing acyclic edge coloring of graphs adjacent strong edge coloring of graphs acyclic edge coloring of graphs Lovasz local lemma |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
