Spanning paths in hypercubes
暂无分享,去创建一个
[1] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[2] Tomás Dvorák,et al. Hamiltonian Cycles with Prescribed Edges in Hypercubes , 2005, SIAM J. Discret. Math..
[3] M. Lewinter,et al. Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .
[4] Mee Yee Chan,et al. On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..
[5] R. Caha,et al. Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets , 2006 .
[6] Chang-Hsiung Tsai. Linear array and ring embeddings in conditional faulty hypercubes , 2004, Theor. Comput. Sci..
[7] Frank Harary,et al. Graph Theory , 2016 .
[8] Václav Koubek,et al. Spanning multi-paths in hypercubes , 2007, Discret. Math..
[9] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .
[10] Petr Gregor,et al. Hamiltonian paths with prescribed edges in hypercubes , 2007, Discret. Math..
[11] I. Havel. On Hamiltonian circuits and spanning trees of hypercubes , 1984 .
[12] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..
[13] Jung-Sheng Fu. Fault-tolerant cycle embedding in the hypercube , 2003, Parallel Comput..
[14] Michel Mollard,et al. Disjoint cycles and spanning graphs of hypercubes , 2004, Discret. Math..