华东师范大学学报（自然科学版）
華東師範大學學報（自然科學版）
화동사범대학학보（자연과학판）
JOURNAL OF EAST CHINA NORMAL UNIVERSITY(NATURAL SCIENCE)
2009年
4期
16-20
,共5页
卞西燕%苗连英%尚华辉%段春燕%马国翼
卞西燕%苗連英%尚華輝%段春燕%馬國翼
변서연%묘련영%상화휘%단춘연%마국익
边划分%邻点可区别%非正常
邊劃分%鄰點可區彆%非正常
변화분%린점가구별%비정상
edge partition%adjacent vertex-distinguishing%non-proper
研究了图的邻点可区别边划分所需要的最少边色数.通过对图的度进行分类讨论,证明了不包含K_2且最小度≥188的图有邻点可区别点染色3边划分.这个结论比已有结果更优越.
研究瞭圖的鄰點可區彆邊劃分所需要的最少邊色數.通過對圖的度進行分類討論,證明瞭不包含K_2且最小度≥188的圖有鄰點可區彆點染色3邊劃分.這箇結論比已有結果更優越.
연구료도적린점가구별변화분소수요적최소변색수.통과대도적도진행분류토론,증명료불포함K_2차최소도≥188적도유린점가구별점염색3변화분.저개결론비이유결과경우월.
The 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.
