Two characterisations of the minimal triangulations of permutation graphs (Q390311): Difference between revisions

@@ Property / cites work @@
+Q4252378
@@ Property / cites work: Q4252378 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation Graphs and Transitive Graphs
@@ Property / cites work: Permutation Graphs and Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Bandwidth on AT-free graphs
@@ Property / cites work: Bandwidth on AT-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Bandwidth for Asteroidal Triple-Free Graphs
+Normal rank
@@ Property / cites work @@
+On treewidth and minimum fill-in of asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+On a property of minimal triangulations
@@ Property / cites work: On a property of minimal triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Treewidth and minimum fill-in on permutation graphs in linear time
+Normal rank
@@ Property / cites work @@
+Triangulating graphs without asteroidal triples
@@ Property / cites work: Triangulating graphs without asteroidal triples / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Representations of chordal graphs as subtrees of a tree
+Normal rank