1. Aleliunas, R., and Rosenberg, A. 1982. On embedding rectangular grids into square grids.IEEE Trans. Comps., C-31: 907?913.
2. Behzad, M., Chartrand, G., and Lesniak-Foster, L. 1979.Graphs and Diagraphs. Prindle, Weber, and Schmidt, Boston.
3. Bhatt, S.N., and Ipsen, I.C.F. 1985. How to embed trees in hypercubes. Res. rept. 443 (Dec), Dept. of Comp. Sci., Yale Univ., New Haven, Conn.
4. Bhatt, S., Chung, F., Leighton, F.T., and Rosenberg, A. 1986. Optimal simulations of tree machines. InProc., 27th Symp. on the Foundations of Comp. Sci., pp. 274?282.
5. Boals, A., Gupta, A., and Sherwani, N. 1992. Incomplete hypercubes: Embeddings and algorithms. Tech. rept. TR/92-22, Dept. of Comp. Sci., W. Mich. Univ., Kalamazoo, Mich.