A Characterisation of the Minimal Triangulations of Permutation Graphs
From MaRDI portal
Publication:3508558
DOI10.1007/978-3-540-74839-7_10zbMath1141.68544OpenAlexW1787922240MaRDI QIDQ3508558
Publication date: 1 July 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_10
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Characterizations and algorithmic applications of chordal graph embeddings
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- A characterisation of rigid circuit graphs
- Triangulating graphs without asteroidal triples
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Representations of chordal graphs as subtrees of a tree
- Algorithmic Aspects of Vertex Elimination on Graphs
- The Pathwidth and Treewidth of Cographs
- Treewidth and Pathwidth of Permutation Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Graph-Theoretic Concepts in Computer Science