Proper Rainbow Connection Number of Graphs
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 t...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
University of Zielona Góra
2021-08-01
|
| Saila: | Discussiones Mathematicae Graph Theory |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.7151/dmgt.2326 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|