Results 181 to 190 of about 4,808,150 (201)
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 International audienceThe search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees.
Olivier Togni, Benoit Darties
exaly +2 more sources
Two counterexamples on completely independent spanning trees [PDF]
Discrete Mathematics, 2012 For each k≥2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma.
Péterfalvi, Ferenc
exaly +2 more sources
Some of the next articles are maybe not open access.
New comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2021Guifu Su
exaly
Completely Independent Spanning Trees in Line Graphs
Graphs and Combinatorics, 2023Toru Hasunuma
exaly
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2020Kung-Jui Pai +2 more
exaly
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
IEEE Transactions on Parallel and Distributed Systems, 2021Baolei Cheng, Dajin Wang
exaly
The Existence of Completely Independent Spanning Trees for Some Compound Graphs
IEEE Transactions on Parallel and Distributed Systems, 2020Xiao-Wen Qin +2 more
exaly
A two-stages tree-searching algorithm for finding three completely independent spanning trees
Theoretical Computer Science, 2019Kung-Jui Pai +2 more
exaly