A Note on the Degree Condition of Completely Independent Spanning Trees
Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, and Jou-Ming Chang
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98-A, No. 10, (2015) pp. 2191-2193.

The above article has been cited by the articles listed below.
  1. Toru Hasunuma, Minimum degree conditions and optimal graphs for completely independent sanning trees, Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, Oct. 5-7, 2015, pp. 260-273

  2. Kung-JuiPai, Jou-Ming Chang, Constructing two completely independent spanning trees in hypercube-variant networks, Theoretical Computer Science 652 (2016) 28-37. (*)

  3. Benoit Darties, Nicolas Gastineau, Olivier Togni, Completely independent spanning trees in some regular graphs, Discrete Applied Mathematics 217 (2017) 163-174. (*)

  4. Baolei Cheng, Dajin Wang, Jianxi Fan, Constructing completely independent spanning trees in crossed cubes, Discrete Applied Mathematics 219 (2017) 100-109. (*)

  5. Axel Moinet, Benoit Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni, Completely independent spanning trees for enhancing the robustness in ad-hoc networks, Proceedings of IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2017), Rome, Italy, Oct. 9-11, 2017, pp. 63-70 (*)

  6. Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang, Completely independent spanning trees on 4-regular chordal rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100-A (2017) 1932-1935. (*)

  7. Ting Pan, Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Dongfang Zhou, Toward the completely independent spanning trees problem on BCube, Proceedings of IEEE 9th International Conference on Communication Software and Networks (ICCSN 2017), Guangzhou, China, May 6-8, 2017, pp. 1103-1106 (*)

  8. Benoit Darties, Nicolas Gastineau, Olivier Togni, Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees, Discrete Applied Mathematics 236 (2018) 124-136. (*)

  9. Smruti A. Mane, Smita A. Kandekar, Balu N. Waphare, Constructing spanning trees in augmented cubes, Journal of Parallel and Distributed Computing 122 (2018) 188-194. (*)

  10. Kung-Jui Pai, Jou-Ming Chang, Improving the diameters of completely independent spanning trees in locally twisted cubes, Information Processing Letters 141 (2019) 22-24. (*)

  11. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang, A two-stages tree-searching algorithm for finding three completely independent spanning trees, Theoretical Computer Science 784 (2019) 65-74. (*)

  12. Kung-Jui Pai, Jou-Ming Chang, Dual-CISTs: configuring a protection routing on some Cayley networks, IEEE/ACM Transactions on Networking 27 (2019) 1112-1123. (*)

  13. Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao, Constructing dual-CISTs of DCell data center networks, Applied Mathematics and Computation 362 (2019) 124546. (*)

  14. Kung-Jui Pai, Designing an algorithm to improve the diameters of completely independent spanning trees in crossed cubes, In: Chang CY., Lin CC., Lin HH. (eds) New Trends in Computer Technologies and Applications, Proceedings of International Computer Symposium (ICS 2018), Communications in Computer and Information Science, vol 1013. Springer, pp. 433-439

  15. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, Proceedings of 21st IEEE International Conference on High Performance Computing and Communications (HPCC 2019), Zhangjiajie, China, August 10-12, 2019, art. no. 8855608, pp. 1358-1365.

  16. Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Constructing two completely independent spanning trees in balanced hypercubes, IEICE Transactions on Information and Systems E102-D (2019) 2409-2412. (*)

  17. Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang, The existence of completely independent spanning trees for some compound graphs, IEEE Transactions on Parallel and Distributed Systems 31 (2020) 201-210. (*)

  18. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, A well-equalized 3-CIST partition of alternating group graphs, Information Processing Letters 155 (2020) Article 105874. (*)

  19. Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang, Comments on "A Hamilton sufficient condition for completely independent spanning tree", Discrete Applied Mathematics 283 (2020) 730-733. (*)

  20. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, A protection routing with secure mechanism in Mobius cubess, Journal of Parallel and Distributed Computing 140 (2020) 1-12. (*)

  21. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Constructing dual-CISTs of pancake graphs and performance assessment of protection routing on some Cayley networks, The Journal of Supercomputing 77 (2021) 990-1014. (*)

  22. Kung-Jui Pai, Ruay-Shiung Chang, JRo-Yu Wu, Jou-Ming Chang, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, Information Sciences 541 (2020) 516-530. (*)

  23. Xiao-Wen Qin, Rong-Xia Hao, Reliability analysis based on the dual-CIST in shuffle-cubes, Applied Mathematics and Computation 397 (2021) 125900. (*)

  24. Ningning Liu, Yujie Zhang, Weibei Fan Construction of completely independent spanning tree based on vertex degree, Proceedings of International Conference on Parallel and Distributed Computing: Applications and Technologies (IPDCAT 2020), Shenzhen, China, Dec. 28-30, 2020, Lecture Notes in Computer Science, Vol 12606. Springer, Cham. pp. 94-103

  25. Yifeng Wang, Baolei Cheng, Jianxi Fan, Yu Qian, Ruofan Jiang, An algorithm to construct completely independent spanning trees in line graphs, The Computer Journal 65(12) (2022) 2979-2990. (*)

  26. Xiao-Wen Qin, Rong-Xia Hao, Jie Wu Construction of dual-CISTs on an infinite class of networks, IEEE Transactions on Parallel and Distributed Systems 33(8) (2022) 1902-1910. (*)

  27. Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang, Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing, IEEE Transactions on Parallel and Distributed Systems 33(8) (2022) 1939-1952. (*)

  28. Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang, Constructing tri-CISTs in shuffle-cubes, Journal of Combinatorial Optimization 44(5) (2022) 3194-3211. (*)

  29. Jun Yuan, Ru Zhang, Aixia Liu, Degree conditions for completely independent spanning trees of bipartite graphs, Graphs and Combinatorics 38(6) (2022) 179. (*)

  30. Baolei Cheng, Dajin Wang, Jianxi Fan, Independent spanning trees in networks - a survey, ACM Computing Surveys 55(14) (2023) 335. (*)

  31. Xia Hong, Wei Feng Completely independent spanning trees in some Cartesian product graphs, AIMS Mathematics 8(7), 16127-16136. (*)

  32. Xia Hong, Feng Gao, Zengbao Wu, Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph, Contributions to Discrete Mathematics 19(2) (2024) 23-35. (*)

Times cited: 28 (from Web of Science)