Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637): Difference between revisions

@@ Property / cites work @@
+Every monotone graph property is testable
@@ Property / cites work: Every monotone graph property is testable / rank @@
+Normal rank
@@ Property / cites work @@
+Several results on chordal bipartite graphs
@@ Property / cites work: Several results on chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Measures on monotone properties of graphs
@@ Property / cites work: Measures on monotone properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Safe separators for treewidth
@@ Property / cites work: Safe separators for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal split completions
@@ Property / cites work: Minimal split completions / rank @@
+Normal rank
@@ Property / cites work @@
+Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
+Normal rank
@@ Property / cites work @@
+Characterizing Minimal Interval Completions
@@ Property / cites work: Characterizing Minimal Interval Completions / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
+Normal rank
@@ Property / cites work @@
+Characterizing and Computing Minimal Cograph Completions
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Doubly lexical ordering of dense 0--1 matrices
@@ Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal bipartite completion of colored graphs
@@ Property / cites work: Chordal bipartite completion of colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank