What Is between Chordal and Weakly Chordal Graphs? (Q5302062): Difference between revisions

@@ Property / cites work @@
+Q2708230
@@ Property / cites work: Q2708230 / 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 @@
+Optimizing weakly triangulated graphs
@@ Property / cites work: Optimizing weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A recognition algorithm for the intersection graphs of paths in trees
+Normal rank
@@ Property / cites work @@
+The edge intersection graphs of paths in a tree
@@ Property / cites work: The edge intersection graphs of paths in a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Intersection Models of Weakly Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Equivalences and the complete hierarchy of intersection graphs of paths in a tree
+Normal rank
@@ Property / cites work @@
+Q4828541
@@ Property / cites work: Q4828541 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity threshold for random chordal graphs
@@ Property / cites work: Connectivity threshold for random chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constant tolerance intersection graphs of subtrees of a tree
+Normal rank
@@ Property / cites work @@
+Tolerance intersection graphs on binary trees with constant tolerance 3
+Normal rank