Two characterisations of the minimal triangulations of permutation graphs
DOI10.1016/J.DISC.2013.06.004zbMATH Open1281.05057OpenAlexW2077491430MaRDI QIDQ390311FDOQ390311
Authors: Daniel Meister 
Publication date: 23 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.004
Recommendations
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- Treewidth and minimum fill-in on permutation graphs in linear time
- Minimal triangulations of graphs: a survey
- Treewidth and Pathwidth of Permutation Graphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Representations of chordal graphs as subtrees of a tree
- A Characterization of Comparability Graphs and of Interval Graphs
- Minimal triangulations of graphs: a survey
- Algorithmic Aspects of Vertex Elimination on Graphs
- Permutation Graphs and Transitive Graphs
- Listing all potential maximal cliques of a graph
- Treewidth and minimum fill-in: Grouping the minimal separators
- Finding induced subgraphs via minimal triangulations
- The Pathwidth and Treewidth of Cographs
- Treewidth and Pathwidth of Permutation Graphs
- Title not available (Why is that?)
- On a property of minimal triangulations
- Characterizations and algorithmic applications of chordal graph embeddings
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A characterisation of rigid circuit graphs
- Triangulating graphs without asteroidal triples
- Title not available (Why is that?)
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs
- Bandwidth on AT-free graphs
- Treewidth and minimum fill-in on permutation graphs in linear time
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
Cited In (4)
This page was built for publication: Two characterisations of the minimal triangulations of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390311)
