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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
University of Zielona Góra
2021-05-01
|
| سلاسل: | Discussiones Mathematicae Graph Theory |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.7151/dmgt.2201 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|