On embedding graphs in trees
- 1 June 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 49 (1), 103-136
- https://doi.org/10.1016/0095-8956(90)90066-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A variation on the min cut linear arrangement problemTheory of Computing Systems, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Topological BandwidthSIAM Journal on Algebraic Discrete Methods, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Graphs That are Almost Binary TreesSIAM Journal on Computing, 1982