Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number
Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number
复制标题
DOI：
10.1016/j.jctb.2005.04.002
复制
发表时间：
2005-11
期刊：
影响因子：
--
通讯作者：
中科院分区：
文献类型：
--
作者：
简单图G的邻点可区别边染色或avd染色是G的正常边染色，使得没有一对邻点满足相同的颜色集。我们证明了每个最大度为Δ且无孤立边的图都有最多为Δ+300色的avd染色，只要Δ>1020.
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree Δ and with no isolated edges has an avd-coloring with at most Δ+300 colors, provided that Δ>1020.