Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963): Difference between revisions

@@ Property / cites work @@
+Induced subgraphs and well‐quasi‐ordering
@@ Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs and well‐quasi‐ordering
@@ Property / cites work: Subgraphs and well‐quasi‐ordering / rank @@
+Normal rank
@@ Property / cites work @@
+On canonical antichains
@@ Property / cites work: On canonical antichains / rank @@
+Normal rank
@@ Property / cites work @@
+Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+Q5734436
@@ Property / cites work: Q5734436 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+Normal rank