Rainbow Connection Number of Graphs with Diameter 3
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G is connected by a rainbow path. Let f(d) deno...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
University of Zielona Góra
2017-02-01
|
| Collection: | Discussiones Mathematicae Graph Theory |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.7151/dmgt.1920 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|