\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588): Difference between revisions

@@ Property / OpenAlex ID @@
+W3134810501
@@ Property / OpenAlex ID: W3134810501 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579375
@@ Property / cites work: Q3579375 / rank @@
+Normal rank
@@ Property / cites work @@
+A kuratowski theorem for the projective plane
@@ Property / cites work: A kuratowski theorem for the projective plane / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden minors characterization of partial 3-trees
+Normal rank
@@ Property / cites work @@
+Q4281679
@@ Property / cites work: Q4281679 / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
+Normal rank
@@ Property / cites work @@
+Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
+Normal rank
@@ Property / cites work @@
+Q4792909
@@ Property / cites work: Q4792909 / rank @@
+Normal rank
@@ Property / cites work @@
+On obstructions to small face covers in planar graphs
+Normal rank
@@ Property / cites work @@
+Q4845370
@@ Property / cites work: Q4845370 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with Branchwidth at Most Three
@@ Property / cites work: Graphs with Branchwidth at Most Three / rank @@
+Normal rank
@@ Property / cites work @@
+On computing graph minor obstruction sets
@@ Property / cites work: On computing graph minor obstruction sets / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse obstructions for minor-covering parameters
@@ Property / cites work: Sparse obstructions for minor-covering parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Bounds for the Flat Wall Theorem
@@ Property / cites work: Improved Bounds for the Flat Wall Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4520519
@@ Property / cites work: Q4520519 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Block elimination distance
@@ Property / cites work: Block elimination distance / rank @@
+Normal rank
@@ Property / cites work @@
+Excluded-minor characterization of apex-outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Q4520532
@@ Property / cites work: Q4520532 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden minors to graphs with small feedback sets
+Normal rank
@@ Property / cites work @@
+Properties of vertex cover obstructions
@@ Property / cites work: Properties of vertex cover obstructions / rank @@
+Normal rank
@@ Property / cites work @@
+Minor‐order obstructions for the graphs of vertex cover 6
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified treatment of linked and lean tree-decompositions
+Normal rank
@@ Property / cites work @@
+FPT is characterized by useful obstruction sets
@@ Property / cites work: FPT is characterized by useful obstruction sets / rank @@
+Normal rank
@@ Property / cites work @@
+Nonconstructive tools for proving polynomial-time decidability
+Normal rank
@@ Property / cites work @@
+On search, decision, and the efficiency of polynomial-time algorithms
+Normal rank
@@ Property / cites work @@
+The Excluded Minors for Isometric Realizability in the Plane
+Normal rank
@@ Property / cites work @@
+Q3773882
@@ Property / cites work: Q3773882 / rank @@
+Normal rank
@@ Property / cites work @@
+The obstructions for toroidal graphs with no \(K_{3,3}\)'s
+Normal rank
@@ Property / cites work @@
+Lean Tree-Cut Decompositions: Obstructions and Algorithms
+Normal rank
@@ Property / cites work @@
+Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
+Normal rank
@@ Property / cites work @@
+Cutwidth: obstructions and algorithmic aspects
@@ Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing the Graph Minors Weak Structure Theorem
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the Size of Planar Intertwines
@@ Property / cites work: Bounding the Size of Planar Intertwines / rank @@
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Planarization Algorithm
@@ Property / cites work: A Near-Optimal Planarization Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+All minor-minimal apex obstructions with connectivity two
+Normal rank
@@ Property / cites work @@
+Linear Rank-Width of Distance-Hereditary Graphs
@@ Property / cites work: Linear Rank-Width of Distance-Hereditary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
+Normal rank
@@ Property / cites work @@
+Planarity Allowing Few Error Vertices in Linear Time
+Normal rank
@@ Property / cites work @@
+Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof of the flat wall theorem
@@ Property / cites work: A new proof of the flat wall theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Obstruction set isolation for the gate matrix layout problem
+Normal rank
@@ Property / cites work @@
+Deleting vertices to graphs of bounded genus
@@ Property / cites work: Deleting vertices to graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+Outerplanar obstructions for matroid pathwidth
@@ Property / cites work: Outerplanar obstructions for matroid pathwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Graph Minor Theorem
@@ Property / cites work: Upper Bounds on the Graph Minor Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273873
@@ Property / cites work: Q4273873 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds on the size of obstructions and intertwines
+Normal rank
@@ Property / cites work @@
+Q4036591
@@ Property / cites work: Q4036591 / rank @@
+Normal rank
@@ Property / cites work @@
+Minor obstructions for apex-pseudoforests
@@ Property / cites work: Minor obstructions for apex-pseudoforests / rank @@
+Normal rank
@@ Property / cites work @@
+Minor-obstructions for apex sub-unicyclic graphs
@@ Property / cites work: Minor-obstructions for apex sub-unicyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Six variations on a theme: almost planar graphs
@@ Property / cites work: Six variations on a theme: almost planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a planar graph by vertex deletion
@@ Property / cites work: Obtaining a planar graph by vertex deletion / rank @@
+Normal rank
@@ Property / cites work @@
+The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and                     obstructions to 𝑛-apex.
+Normal rank
@@ Property / cites work @@
+Obstructions of Connectivity Two for Embedding Graphs into the Torus
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+The Structure and Number of Obstructions to Treewidth
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273877
@@ Property / cites work: Q4273877 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / 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. XXI. graphs with unique linkages
@@ Property / cites work: Graph minors. XXI. graphs with unique linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XXII. Irrelevant vertices in linkage problems
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Sachs' linkless embedding conjecture
@@ Property / cites work: Sachs' linkless embedding conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Outerplanar obstructions for a feedback vertex set
+Normal rank
@@ Property / cites work @@
+<i>k</i>             -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms and obstructions for linear-width and related search parameters
+Normal rank
@@ Property / cites work @@
+Graph Minors and Parameterized Algorithm Design
@@ Property / cites work: Graph Minors and Parameterized Algorithm Design / rank @@
+Normal rank
@@ Property / cites work @@
+A Menger-like property of tree-width: The finite case
+Normal rank
@@ Property / cites work @@
+On the ?largeur d'arborescence?
@@ Property / cites work: On the ?largeur d'arborescence? / rank @@
+Normal rank
@@ Property / cites work @@
+More forbidden minors for wye-delta-wye reducibility
+Normal rank