Constructing two completely independent spanning trees in hypercube-variant networks
Theoretical Computer Science, 2016Kung-Jui Pai, Jou-Ming Chang
exaly
Completely independent spanning trees in split graphs
Discrete Applied MathematicsYang Hu, Yuting Tian
openaire +1 more source
Completely Independent Spanning Trees in Folded Hypercube-Variant Networks
2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)Junkai Zhu +4 more
openaire +2 more sources
Constructing completely independent spanning trees in the generalized hypercube network
The Journal of SupercomputingHui Dong +3 more
openaire +2 more sources
The completely independent spanning trees in P 4 -free graphs
Discrete Applied MathematicsShangwei Lin, Jun Yuan, Aixia Liu
exaly
Completely independent spanning trees in k th power of 2-connected graphs
Discrete Applied MathematicsZhizheng Zhang
exaly
Completely Independent Spanning Trees in the Line Graphs of Complete Bipartite Graphs
Advances in Applied Mathematicsopenaire +1 more source
The existence condition of k completely independent spanning tree for some graphs
Theoretical Computer Scienceopenaire +2 more sources

