Completely independent spanning trees in some Cartesian product graphs
Let $ T_{1}, T_{2}, \dots, T_{k} $ 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 $ T_{1}, T_{2}, \dots, T_{k} $ are completely independent. Hasunuma showed that there ar...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-05-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023823?viewType=HTML |