1. Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1980
2. Dunne, P.E.: Improved Upper Bounds on the Area Required to Embed Arbitrary Graphs; Theory of Computation Rep. No. 55, (unpublished internal report), Dept. of Comput. Sci., Univ. of Warwick 1983
3. Leiserson, C.: Area-efficient Graph Layouts (for VLSI), Proc. 21st IEEE Symposium on foundations of Comput. Sci., pp. 270?281 (1980)
4. Mead, C., Conway, L.: Introduction to VLSI Systems. Reading, Mass.: Addison-Wesley 1980
5. Valiant, L.G.: Universality considerations in VLSI circuits; IEEE Trans. Comput. 30, 135?140 (1981)