摘要
图G的一个边染色称作是G的正常边染色,如果G中任意两条邻接边上所染颜色不同.如果图G的一个正常边染色使得G中没有长为4的路或4-圈是2-边染色的,则称此边染色是G的一个星边染色.对G进行星边染色所需的最小颜色数称为G的星边色数.研究了三角形六角系统的星边染色,应用构造方法证明了三角形六角系统的星边色数等于4.
An edge-coloring of a graph G is called a proper edge-coloring of G if any two adjacent edges do not have the same color. A proper edge-coloring of graph G is called a star edge-coloring of G if there is neither 2-edge colored path with length four nor 2-edge colored cycle with length four in G. The minimum number of colors required for any star edge-coloring of G is called the star chromatic index of G. By using constructive method, it is proved that the star chromatic index of triangle-shaped polyhexes is four
出处
《中北大学学报(自然科学版)》
CAS
北大核心
2013年第6期610-612,共3页
Journal of North University of China(Natural Science Edition)
基金
中央高校基本科研业务专项资金(zyz2011081)
关键词
边染色
星边染色
星边色数
三角形六角系统
edge-coloring
star edge-coloring
star chromatic index
triangle-shaped polyhexs