On the pathwidth of chordal graphs
- 1 September 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 45 (3) , 233-248
- https://doi.org/10.1016/0166-218x(93)90012-d
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Min cut is NP-complete for edge weighted treesTheoretical Computer Science, 1988
- The complexity of searching a graphJournal of the ACM, 1988
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Searching and pebblingTheoretical Computer Science, 1986
- Interval graphs and seatchingDiscrete Mathematics, 1985
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964