References
- Caha , R. and Koubek , V. 2007 . Spanning multi-paths in hypercubes . Discrete Math. , 307 : 2053 – 2066 .
- Choudum , S. A. and Lavanya , S. 2006 . Spanning caterpillars of hypercubes , preprint, IITM
- Dvořák , T. , Gregor , P. and Koubek , V. Spanning paths in hypercubes . 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), DMTCS Proceedings . Edited by: Felsner , S. pp. 363 – 368 . Discrete Mathematics and Theoretical Computer Science .
- Gonzalez , T. F. and Serena , D. Complexity of k-pairwise disjoint shortest paths in the undirected hyprecubic network and related problems . Proceedings of the International Conference on Parallel and Distributed Computing and Systems, PDCS . Canada. IASTED, Acta Press .
- Gonzalez , T. F. and Serena , D. 2004 . n-cube network: node disjoint shortest paths for maximal distance pairs of vertices . Parallel Comput. , 30 ( 8 ) : 973 – 998 .
- Gu , Q.-P. and Peng , S. 2000 . An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes . J. Parallel Distrib. Comput. , 60 : 764 – 774 .
- Havel , I. 1984 . On hamilton circuits and spanning trees of hypercubes . [Cbreve]asopis pro Pĕstování Matematiky , 109 : 135 – 152 .
- Leighton , F. T. 1992 . Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , San Mateo, CA : Morgan Kauffmann .
- Nebeský , L. 1988 . Embedding m-quasistars into n-cubes . Czech. Math. J , 38 : 705 – 712 .