The following publications are possibly variants of this publication:
- An improved algorithm to construct edge-independent spanning trees in augmented cubesBaolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang. DAM, 277:55-70, 2020. [doi]
- Constructing independent spanning trees for locally twisted cubesYi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen. TCS, 412(22):2237-2252, 2011. [doi]
- Constructing completely independent spanning trees in crossed cubesBaolei Cheng, Dajin Wang, Jianxi Fan. DAM, 219:100-109, 2017. [doi]
- An algorithm to construct independent spanning trees on parity cubesYan Wang, Jianxi Fan, Xiaohua Jia, He Huang. TCS, 465:61-72, 2012. [doi]
- Edge-independent spanning trees in augmented cubesYan Wang, Hong Shen, Jianxi Fan. TCS, 670:23-32, 2017. [doi]
- Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented CubeGuo Chen, Baolei Cheng, Dajin Wang. tpds, 32(3):665-673, 2021. [doi]
- A Parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted CubeZhiyong Pan, Baolei Cheng, Jianxi Fan, Huanwen Zhang. paap 2021: 9-13 [doi]
- Constructing Independent Spanning Trees for Hypercubes and Locally Twisted CubesYi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen. ispan 2009: 17-22 [doi]
- Constructing independent spanning trees with height n on the n-dimensional crossed cubeBaolei Cheng, Jianxi Fan, Qiang Lyu, Jingya Zhou, Zhao Liu. fgcs, 87:404-415, 2018. [doi]