Edge-colouring of joins of regular graphs II (Articolo in rivista)

Type
Label
  • Edge-colouring of joins of regular graphs II (Articolo in rivista) (literal)
Anno
  • 2011-01-01T00:00:00+01:00 (literal)
Alternative label
  • De Simone, C.; Galluccio, A. (2011)
    Edge-colouring of joins of regular graphs II
    in Journal of combinatorial optimization
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • De Simone, C.; Galluccio, A. (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Online First™, 18 October 2011 - DOI: 10.1007/s10878-011-9420-4 (literal)
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • IASI-CNR (literal)
Titolo
  • Edge-colouring of joins of regular graphs II (literal)
Abstract
  • We prove that the edges of every even graph G = G1 + G2 that is the join of two regular graphs G1 and G2 can be coloured with ?(G) colours, whenever ?(G) = ?(G1)+|V2|. 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)-edgecolouring of this type of graphs. Keywords Edge-colouring · Join · Regular (literal)
Prodotto di
Autore CNR

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it