- Tytuł:
- Rainbow Connection Number of Graphs with Diameter 3
- Autorzy:
-
Li, Hengzhe
Li, Xueliang
Sun, Yuefang - Powiązania:
- https://bibliotekanauki.pl/articles/31342160.pdf
- Data publikacji:
- 2017-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge-coloring
rainbow path
rainbow connection number
diameter - Opis:
- 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) denote the minimum number such that rc(G) ≤ f(d) for each bridgeless graph G with diameter d. In this paper, we shall show that 7 ≤ f(3) ≤ 9.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 141-154
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł