Quickly excluding a forest
- 1 July 1991
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 52 (2) , 274-283
- https://doi.org/10.1016/0095-8956(91)90068-u
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Graph minors. X. Obstructions to tree-decompositionJournal of Combinatorial Theory, Series B, 1991
- Monotonicity in graph searchingJournal of Algorithms, 1991
- Searching and pebblingTheoretical Computer Science, 1986
- Interval graphs and seatchingDiscrete Mathematics, 1985
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983