The pathwidth and treewidth of cographs
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 301-309
- https://doi.org/10.1007/3-540-52846-6_99
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Graph Problems Related to Gate Matrix Layout and PLA FoldingPublished by Springer Nature ,1990
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. VI. Disjoint paths across a discJournal of Combinatorial Theory, Series B, 1986
- Searching and pebblingTheoretical Computer Science, 1986
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Interval graphs and seatchingDiscrete Mathematics, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Complement reducible graphsDiscrete Applied Mathematics, 1981