1. Bhatt S.N. and Leighton F.T., A framework for solving VLSI graph layout problem.J. Comput. System Sci.28(1984) 300–343.
2. Bezrukov S.L., Chavez J.D., Harper L.H., Röttger M. and Schroeder U.P., Embedding of hypercubes into grids, MFCS’98.Lect. Notes Comput. Sci.1450(1998) 693–701.
3. Bezrukov S.L., Chavez J.D., Harper L.H., Röttger M. and Schroeder U.P., The congestion of n-cube layout on a rectangular grid.Discrete Math.213(2000) 13–19.
4. Chinn P.Z., Chvátalová J., Dewdney A.K. and Gibbs N.E., The bandwidth problem for graphs and matrices – A survey.J. Graph Theor.6(1982) 223–254.
5. F.R.K. Chung, Labelings of graphs, inSelected topics in graph theory, L.W. Beineke and R.J. Wilson, Eds.3(1988) 151–168.