Universal Graphs for Bounded-Degree Trees and Planar Graphs
- 1 May 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (2) , 145-155
- https://doi.org/10.1137/0402014
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Expanding graphs contain all small treesCombinatorica, 1987
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Perfect Storage Representations for Families of Data StructuresSIAM Journal on Algebraic Discrete Methods, 1983
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983
- On Universal Graphs for Spanning TreesJournal of the London Mathematical Society, 1983
- Universal caterpillarsJournal of Combinatorial Theory, Series B, 1981
- ON UNIVERSAL GRAPHSAnnals of the New York Academy of Sciences, 1979
- On graphs which contain all small treesJournal of Combinatorial Theory, Series B, 1978
- Pancyclic graphs IJournal of Combinatorial Theory, Series B, 1971