On a property of minimal triangulations
From MaRDI portal
Publication:1024493
DOI10.1016/j.disc.2008.01.048zbMath1205.05122OpenAlexW1985768609WikidataQ60500846 ScholiaQ60500846MaRDI QIDQ1024493
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.048
Related Items
Cites Work
- Unnamed Item
- Minimal triangulations of graphs: a survey
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- Characterizations and algorithmic applications of chordal graph embeddings
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Listing all potential maximal cliques of a graph
- Triangulating graphs without asteroidal triples
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph Classes: A Survey
- Treewidth and Pathwidth of Permutation Graphs