Edge-colouring of joins of regular graphs, I

Caterina De Simone () and Anna Galluccio ()
Additional contact information
Caterina De Simone: IASI–CNR
Anna Galluccio: IASI–CNR

Journal of Combinatorial Optimization, 2009, vol. 18, issue 4, No 7, 417-428

Abstract: 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: Edge-colouring; Join; Regular graph (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9235-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9235-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9235-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().