On meshy trees

References

• Harary , F. 1969 . Graph Theory , Reading : Addison-Wesley .
   Google Scholar
• Ullman , J. D. 1984 . Computational Aspects of VLSI , Rockville : Computer Science Press .
   Google Scholar
• Youn , H. Y. and Singh , A. D. 1987 . Proc. Int'l. Conf. on Parallel Processing . On area efficient and fault tolerant tree embeddings in VLSI . 1987 . pp. 170 – 177 .
   Google Scholar
• Havel , I. and Liebl , P. 1973 . Embedding the polytomic tree into the n-cube . Casopis Pest. Mat. , 98 : 307 – 314 .
   Google Scholar
• Wu , A. Y. 1985 . Embedding of tree networks into hypercubes . J. Parallel and Distributed Computing , 2 : 238 – 249 .
   Google Scholar
• 1986 . Proc. Foundations of Computer Science Symp. . Optimal simulations of tree machines . 1986 . pp. 274 – 282 .
   Google Scholar
• Harary , F. , Hayes , J. P. and Wu , H.-J. 1988 . A survey of the theory of hypercube graphs . Comput. Math. Appl. , 15 : 277 – 289 .
   Web of Science ®Google Scholar
• Livingston , M. and Stout , Q. F. 1988 . Embeddings in hypercubes . Math. Comput. Modelling , 11 : 222 – 227 .
   Google Scholar