Pregled bibliografske jedinice broj: 1252730
Some Remarks on Rainbow Connectivity
Some Remarks on Rainbow Connectivity // Journal of Graph Theory, 83 (2015), 4; 372-383 doi:10.1002/jgt.22003 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1252730 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Some Remarks on Rainbow Connectivity
Autori
Kamčev, Nina ; Krivelevich, Michael ; Sudakov, Benny
Izvornik
Journal of Graph Theory (0364-9024) 83
(2015), 4;
372-383
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
rainbow connectivity
Sažetak
An edge (vertex) colored graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colors. Rainbow edge (vertex) connectivity of a graph G is the smallest number of colors needed for a rainbow edge (vertex) coloring of G. In this article, we propose a very simple approach to studying rainbow connectivity in graphs. Using this idea, we give a unified proof of several known results, as well as some new ones.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
