摘要
研究了图的邻点可区别边划分所需要的最少边色数.通过对图的度进行分类讨论,证明了不包含K_2且最小度≥188的图有邻点可区别点染色3边划分.这个结论比已有结果更优越.
The minimum number of colors required to give a graph G an adjacent vertexdistinguishing edge partition was studied. Based on the classification of the degree of a graph, this paper proved that every graph without K2 of minimum degree at least 188 permits an adjacent vertex-distinguishing 3-edge partition. The result is more superior than previous ones.
出处
《华东师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第4期16-20,共5页
Journal of East China Normal University(Natural Science)
关键词
边划分
邻点可区别
非正常
edge partition
adjacent vertex-distinguishing
non-proper
