Characterizing and generalizing cycle completable graphs (Q6184532): Difference between revisions

@@ Property / cites work @@
+Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Contribution to nonserial dynamic programming
@@ Property / cites work: Contribution to nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+The real positive definite completion problem: cycle completability
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean distance completion problem: cycle completability
+Normal rank
@@ Property / cites work @@
+Structural conditions for cycle completable graphs
+Normal rank
@@ Property / cites work @@
+On graphs with no induced subdivision of \(K_4\)
@@ Property / cites work: On graphs with no induced subdivision of \(K_4\) / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank