Rainbow Connection In Sparse Graphs
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours such that G is rainbow-connected. In this pap...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Zielona Góra
2013-03-01
|
| Serier: | Discussiones Mathematicae Graph Theory |
| Fag: | |
| Online adgang: | https://doi.org/10.7151/dmgt.1640 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|