On Proper (Strong) Rainbow Connection of Graphs
A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path. Recently, Johnson et al. considered this concept with the additional requireme...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
University of Zielona Góra
2021-05-01
|
| Rangatū: | Discussiones Mathematicae Graph Theory |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.7151/dmgt.2201 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|