Geodesic
Proper Rainbow Connection Number of Graphs
Discussiones Mathematicae. Graph Theory, Tome 41 (2021) no. 3, pp. 809-826

Voir la notice de l'article provenant de la source Library of Science

A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path. The minimum k for which there exists such an edge-colouring is the rainbow connection number rc(G) of G. Recently, Bau et al. [Rainbow connectivity in some Cayley graphs, Australas. J. Combin. 71 (2018) 381–393] introduced this concept with the additional requirement that the edge-colouring must be proper. The proper rainbow connection number of G, denoted by prc(G), is the minimum number of colours needed in order to make it properly rainbow connected. Obviously, prc(G) ≥ maxrc(G), χ′(G). In this paper we first prove an improved upper bound prc(G) ≤ n for every connected graph G of order n ≥ 3. Next we show that the difference prc(G) – maxrc(G), χ′(G) can be arbitrarily large. Finally, we present several sufficient conditions for graph classes satisfying prc(G) = χ′(G).
Keywords: edge-colouring, rainbow connection number, proper rainbow connection number 
@article{DMGT_2021_41_3_a7,
     author = {Doan, Trung Duy and Schiermeyer, Ingo},
     title = {Proper {Rainbow} {Connection} {Number} of {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {809--826},
     publisher = {mathdoc},
     volume = {41},
     number = {3},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2021_41_3_a7/}
}
TY  - JOUR
AU  - Doan, Trung Duy
AU  - Schiermeyer, Ingo
TI  - Proper Rainbow Connection Number of Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2021
SP  - 809
EP  - 826
VL  - 41
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2021_41_3_a7/
LA  - en
ID  - DMGT_2021_41_3_a7
ER  - 
%0 Journal Article
%A Doan, Trung Duy
%A Schiermeyer, Ingo
%T Proper Rainbow Connection Number of Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2021
%P 809-826
%V 41
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2021_41_3_a7/
%G en
%F DMGT_2021_41_3_a7
Doan, Trung Duy; Schiermeyer, Ingo. Proper Rainbow Connection Number of Graphs. Discussiones Mathematicae. Graph Theory, Tome 41 (2021) no. 3, pp. 809-826. http://geodesic.mathdoc.fr/item/DMGT_2021_41_3_a7/