1. On the complexity of testing a graph for n-cube;Bhat;Inform. Process. Lett.,1980
2. Heterogeneous processes on homogeneous processors;Cybenko,1986
3. Distance-preserving subgraphs of hypercubes;Djokovic;J. Combin. Theory Ser. B,1973
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Hypercube embedding is NP-complete;Krumme,1985