摘要
无圈边染色是指图G的一个正常边染色,使其不产生双色圈.研究了不含特殊短圈平面图的无圈边染色问题,证明了:如果平面图G不含4到8-圈,那么G的无圈边染色数不大于Δ(G)+1.
A proper edge coloring of a graph G is called acyclic if there are no bicolored cycles in G.It was proved that every planar graph without cycles of lengths 4 to 8 was acyclic(Δ(G)+1)-edge colorable.
出处
《浙江师范大学学报(自然科学版)》
CAS
2012年第1期32-36,共5页
Journal of Zhejiang Normal University:Natural Sciences
关键词
平面图
圈
无圈边染色
无圈边色数
planar graph
cycle
acyclic edge coloring
acyclic edge chromatic number