The complexity of induced minors and related problems (Q1346772): Difference between revisions

@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q3034816
@@ Property / cites work: Q3034816 / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Noncrossing Subgraphs in Topological Layouts
@@ Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+A note on odd/even cycles
@@ Property / cites work: A note on odd/even cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3821580
@@ Property / cites work: Q3821580 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced circuits in planar graphs
@@ Property / cites work: Induced circuits in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
+Normal rank
@@ Property / cites work @@
+Disjoint homotopic paths and trees in a planar graph
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+Graphs without \(K_ 4\) and well-quasi-ordering
@@ Property / cites work: Graphs without \(K_ 4\) and well-quasi-ordering / rank @@
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank