-
摘要: 研究了图的邻点可区别边划分所需要的最少边色数. 通过对图的度进行分类讨论, 证明了不包含$K_{2}$且最小度$\geqslant188$的图有邻点可区别点染色3边划分. 这个结论比已有结果更优越Abstract: he minimum number of colors required to give a graph $G$ an adjacent vertex-distinguishing edge partition was studied. Based on the classification of the degree of a graph, this paper proved that every graph without $K_{2}$ of minimum degree at least 188 permits an adjacent vertex-distinguishing 3-edge partition. The result is more superior than previous ones.
-
点击查看大图
计量
- 文章访问数: 2585
- HTML全文浏览量: 15
- PDF下载量: 1295
- 被引次数: 0
下载: