1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Eigenvalues, expanders and superconcentrators;Alon,1984
3. A framework for solving VLSI graph layout problems;Bhatt;J. Comput. System Sci.,1984
4. The bandwidth problem for graphs and matrices—A survey;Chinn;J. Graph Theory,1982
5. F. R. K. Chung, Labelings of graphs, in “Selected Topics in Graph Theory, III” (L. Beineke and R. Wilson, Eds.).