Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)

Araki, 2003, Edge-pancyclicity of recursive circulants, Inform. Process Lett., 88, 287, 10.1016/j.ipl.2003.09.003 Araki, 2002, Pancyclicity of recursive circulant graphs, Inform. Process Lett., 81, 187, 10.1016/S0020-0190(01)00226-5 Biss, 2000, Hamiltonian decomposition of recursive circulant graphs, Discrete Math., 214, 89, 10.1016/S0012-365X(99)00199-5 Bondy, 1976 Chang, 2004, Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs, Networks, 44, 302, 10.1002/net.20039 Chen, 1980, On strongly hamiltonian abelian group graphs, vol. 884, 23 Fan, 2007, Optimal embeddings of paths with various lengths in twisted cubes, IEEE Trans. Parallel Distrib. Syst., 18, 511, 10.1109/TPDS.2007.1003 J. Fan, X. Lin, X. Jia, R.W.H. Lau, Edge-pancyclicity of twisted cubes, in: Proc. of International Symposium on Algorithms and Computation, ISAAC 2005, December 2005, pp. 1090–1099 Fan, 2005, Node-pancyclicity and edge-pancyclicity of crossed cubes, Inform. Process Lett., 93, 133, 10.1016/j.ipl.2004.09.026 G. Gauyacq, C. Micheneau, A. Raspaud, Routing in recursive circulant graphs: Edge forwarding index and hamiltonian decomposition, in: Proc. of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG98, 1998, pp. 227–241 S.-Y. Hsieh, N.-W. Chang, Cycle embedding on the Möbius cube with both faulty nodes and faulty edges, in: Proc. of 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, 2005 Lim, 1996, Embedding trees into recursive circulants, Discrete Appl. Math., 69, 83, 10.1016/0166-218X(95)00078-6 Ma, 2007, Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes, Parallel Comput., 33, 36, 10.1016/j.parco.2006.11.008 Ma, 2006, Panconnectivity of locally twisted cubes, Appl. Math. Lett., 19, 673, 10.1016/j.aml.2005.08.021 J.-H. Park, Hamiltonian decomposition of recursive circulants, in: Proc. International Symposium on Algorithms and Computation, ISAAC’98, Taejon, Korea, 1998, pp. 297–306 Park, 2001, Strong hamiltonicity of recursive circulants, J. KISS, 28, 399 Park, 2004, Cycle embedding of faulty recursive circulants, J. KISS, 31, 86 Park, 2000, Recursive circulants and their embeddings among hypercubes, Theoret. Comput. Sci., 244, 35, 10.1016/S0304-3975(00)00176-6 J.-H. Park, H.-C. Kim, H.-S. Lim, Fault-hamiltonicity of hypercube-like interconnection networks, in: Proc. IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005, Denver, April 2005 Park, 2007, Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements, Theoret. Comput. Sci., 377, 170, 10.1016/j.tcs.2007.02.029 Sengupta, 1998, On ring embedding in hypercubes with faulty nodes and links, Inform. Process Lett., 68, 207, 10.1016/S0020-0190(98)00159-8 C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, L.-H. Hsu, Fault-free cycles and links in faulty recursive circulant graphs, in: Proc. of the Workshop on Algorithms and Theory of Computation, ICS 2000, 2000, pp. 74–77 Yang, 2003, Fault-tolerant cycle-embedding of crossed cubes, Inform. Process Lett., 88, 149, 10.1016/j.ipl.2003.08.007 Yang, 2006, On embedding cycles into faulty twisted cubes, Inform. Sci., 176, 676, 10.1016/j.ins.2005.04.004