The following publications are possibly variants of this publication:
- An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault ModelHongbin Zhuang, Xiao-yan Li, Jou-Ming Chang, Dajin Wang. tpds, 34(6):1802-1815, June 2023. [doi]
- Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty EdgesSun-Yuan Hsieh, Nai-Wen Chang. TC, 55(7):854-863, 2006. [doi]
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty ElementsJing Li, Chris Melekian, Shurong Zuo, Eddie Cheng 0001. ijfcs, 31(3):371-383, 2020. [doi]
- Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edgesJing Li, Shiying Wang, Di Liu, Shangwei Lin. isci, 181(11):2260-2267, 2011. [doi]
- Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure FaultsYali Lv, Cheng-Kuan Lin, Jianxi Fan. cj, 60(2):159-179, 2017. [doi]
- Embedding cycles and paths in a k-ary n-cubeSun-Yuan Hsieh, Tsong-Jie Lin. icpads 2007: 1-7 [doi]