The above article has been cited by the articles listed below.
Ajay Kumar, Debdas Mishra,
A survey on existing conditions of hamiltonian graphs ,
Journal of Mathematical Control Science and Applications 7(1) (2021) 35-43. Junjiang Li, Guifu Su, Guanbang Song,
New comments on "A Hamilton sufficient condition for completely independent spanning tree" ,
Discrete Applied Mathematics 305 (2021) 10-15.(*) 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.(*) Zhaoyong Deng, Weike Chen,
Deep neural network method to study computer game ,
2022 IEEE 2nd International Conference on Power, Electronics and Computer Applications (ICPECA), Shenyang, China, Jan. 21-23, 2022, pp. 780-782. 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.(*) Jun Yuan, Ru Zhang, Aixia Liu,
Degree conditions for completely independent spanning trees of bipartite graphs ,
Graphs and Combinatorics 38(6) (2022) 179.(*) Baolei Cheng, Dajin Wang, Jianxi Fan,
Independent Spanning Trees in Networks - A Survey ,
ACM Computing Surveys 55(14) (2023) 335.(*) Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su,
Every 2-connected {claw,Z3 }-free graph with minimum degree at least 4 contains two CISTs ,
Discrete Applied Mathematics 360 (2025) 51-64.(*)
Times cited: 6