Graphs with small bandwidth and cutwidth
- 1 May 1989
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 75 (1-3) , 113-119
- https://doi.org/10.1016/0012-365x(89)90083-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the Cutwidth and the Topological Bandwidth of a TreeSIAM Journal on Algebraic Discrete Methods, 1985
- 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
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on TreesSIAM Journal on Algebraic Discrete Methods, 1982