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 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|