A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs

被引：0
|
作者：
De Simone, Caterina [1 ]
Galluccio, Anna [1 ]
机构：
[1] CNR, Ist Anal Sistemi & Informat, I-00185 Rome, Italy
来源：
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS | 2008年 / 5165卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that the edges of every even graph G = G(1) + G(2) that is the join of two regular graphs G(i) = (V(i), E(i)) can be coloured with Delta(G) colours, whenever Delta(G) = Delta(G(2)) + vertical bar V(G(1))vertical bar. The proof of this result yields a combinatorial algorithm to optimally colour the edges of this type of graphs.
引用
收藏
页码：351 / 360
页数：10
相关论文
共 50 条
12345