Completely Independent Spanning Trees in k-Th Power of Graphs
Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of a 2-connected graph G on n vertices with n ≥...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
University of Zielona Góra
2018-08-01
|
| سلاسل: | Discussiones Mathematicae Graph Theory |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.7151/dmgt.2038 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|