Edge-colouring of joins of regular graphs II

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

Journal of Combinatorial Optimization, 2013, vol. 25, issue 1, No 5, 78-90

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 1 and G 2 can be coloured with Δ(G) colours, whenever Δ(G)=Δ(G 1)+|V 2|. The proof of this result together with the results in De Simone and Galluccio (J. Comb. Optim. 18:417–428, 2009) states that every even graph G that is the join of two regular graphs is Class 1. The proof yields an efficient combinatorial algorithm to find a Δ(G)-edge-colouring of this type of graphs.

Keywords: Edge-colouring; Join; Regular graphs (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9420-4 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:25:y:2013:i:1:d:10.1007_s10878-011-9420-4

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

DOI: 10.1007/s10878-011-9420-4

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 ().