Author:
Hussain Zaid,AlAzemi Fawaz,AlBdaiwi Bader
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of DCell networks. Theor Comput Sci 609:197–210
2. Yang J-S, Li X-Y, Peng S-L, Chang J-M (2022) Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. Appl Math Comput 413:126617
3. Darties B, Gastineau N, Togni O (2018) Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees. Discret Appl Math 236:124–136
4. Hasunuma T (2002) Completely independent spanning trees in maximal planar graphs. In: Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002 Českỳ Krumlov, Czech Republic, June 13–15, 2002 Revised Papers 28, Springer, pp 235–245
5. Hong X, Feng W (2023) Completely independent spanning trees in some cartesian product graphs. AIMS Math 8(7):16127–16136