http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7419
A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs (Contributo in atti di convegno)
- Type
- Label
- A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs (Contributo in atti di convegno) (literal)
- Anno
- 2008-01-01T00:00:00+01:00 (literal)
- Alternative label
De Simone, C.; Galluccio, A. (2008)
A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs
in 2nd International Conference on Combinatorial Optimization and Applications, St Johns, CANADA, 21-24 agosto 2008
(literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- De Simone, C.; Galluccio, A. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
- COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- booktitles: Combinatorial optimization and applications (literal)
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Titolo
- A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
- 978-3-540-85096-0 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume
- Yang, B; Du, DZ; Wang, CA (literal)
- Abstract
- We prove that the edges of every even graph G = G1 + G2
that is the join of two regular graphs Gi = (Vi,Ei) can be coloured with
?(G) colours, whenever ?(G) = ?(G2) + |V (G1)|. The proof of this
result yields a combinatorial algorithm to optimally colour the edges of
this type of graphs. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Autore CNR di
- Prodotto