Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, Tome 37 (2017) no. 1, p. 141.
Voir la notice de l'article dans European Digital Mathematics Library
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.
Classification :
05C15, 05C40
Mots-clés : edge-coloring, rainbow path, rainbow connection number, diameter, edge coloring
Mots-clés : edge-coloring, rainbow path, rainbow connection number, diameter, edge coloring
@article{DMGT_2017__37_1_288080, author = {Hengzhe Li and Xueliang Li and Yuefang Sun}, title = {Rainbow {Connection} {Number} of {Graphs} with {Diameter} 3}, journal = {Discussiones Mathematicae Graph Theory}, pages = {141}, publisher = {mathdoc}, volume = {37}, number = {1}, year = {2017}, zbl = {1354.05050}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2017__37_1_288080/} }
TY - JOUR AU - Hengzhe Li AU - Xueliang Li AU - Yuefang Sun TI - Rainbow Connection Number of Graphs with Diameter 3 JO - Discussiones Mathematicae Graph Theory PY - 2017 SP - 141 VL - 37 IS - 1 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2017__37_1_288080/ LA - en ID - DMGT_2017__37_1_288080 ER -
Hengzhe Li; Xueliang Li; Yuefang Sun. Rainbow Connection Number of Graphs with Diameter 3. Discussiones Mathematicae Graph Theory, Tome 37 (2017) no. 1, p. 141. https://geodesic-test.mathdoc.fr/item/DMGT_2017__37_1_288080/