On graphs that are not PCGs (Q2512661): Difference between revisions

@@ Property / cites work @@
+Rooted directed path graphs are leaf powers
@@ Property / cites work: Rooted directed path graphs are leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+Exact leaf powers
@@ Property / cites work: Exact leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+Characterising \((k,\ell )\)-leaf powers
@@ Property / cites work: Characterising \((k,\ell )\)-leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+On Dilworth k Graphs and Their Pairwise Compatibility
+Normal rank
@@ Property / cites work @@
+On pairwise compatibility graphs having Dilworth number \(k\)
+Normal rank
@@ Property / cites work @@
+On pairwise compatibility graphs having Dilworth number two
+Normal rank
@@ Property / cites work @@
+On Relaxing the Constraints in Pairwise Compatibility Graphs
+Normal rank
@@ Property / cites work @@
+On Graphs That Are Not PCGs
@@ Property / cites work: On Graphs That Are Not PCGs / rank @@
+Normal rank
@@ Property / cites work @@
+Leaf Powers and Their Properties: Using the Trees
@@ Property / cites work: Leaf Powers and Their Properties: Using the Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Strictly chordal graphs are leaf powers
@@ Property / cites work: Strictly chordal graphs are leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Powers for Leaf-Labeled Trees
@@ Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
@@ Property / cites work: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Pairwise compatibility graphs
@@ Property / cites work: Pairwise compatibility graphs / rank @@
+Normal rank