摘要
设G是简单图,用颜色1,2,3,…对G进行正常边着色,若每一个顶点上表现的颜色都能构成一个连续的整数集合,则称这个边着色是连续的.图G的亏度def(G)等于粘在G上使它可连续边着色的悬挂边的最小数目.文章研究了四类圈树的亏度.
Given a simple graph G,an edge-coloring of G with consecutive if the colors represented at each vertex form an interva G which is denoted by def（G）is the minimum number of pendant e G consecutively colorable. We discuss the deficiency of four classes 1 of colors 1,2,3, … is called integers. The deficiency of dges wh of cycle ose attachment makes trees.
出处
《太原师范学院学报（自然科学版）》
2012年第4期4-6,共3页
Journal of Taiyuan Normal University:Natural Science Edition
关键词
正常边着色
连续边着色
亏度
圈树
proper edge coloring
consecutive colorings
deficiency of graph
cycle trees
