首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Edge-colouring of joins of regular graphs, I
Authors:Caterina De Simone  Anna Galluccio
Institution:1. IASI–CNR, viale Manzoni 30, 00185, Rome, Italy
Abstract: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 Δ(G) colours, whenever Δ(G)=Δ(G 2)+|V 1|. The proof of this result yields a combinatorial algorithm to optimally colour the edges of this type of graphs.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号