A more accurate view of the flat wall theorem

DOI10.1002/JGT.23121zbMATH Open1547.05286MaRDI QIDQ6606321

Dimitrios M. Thilikos, Ignasi Sau, Giannos Stamoulis

Publication date: 16 September 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

treewidthparameterized algorithmsgraph minorsirrelevant vertex techniqueflat wall theoremhomogeneous walls

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The disjoint paths problem in quadratic time
• Graph minors. XXII. Irrelevant vertices in linkage problems
• Linkless and flat embeddings in 3-space
• Faster parameterized algorithms for minor containment
• Algorithms for finding an induced cycle in planar graphs
• A new proof of the flat wall theorem
• Induced packing of odd cycles in planar graphs
• Linearity of grid minors in treewidth with applications through bidimensionality
• Graph minors. XXI. graphs with unique linkages
• The extremal function for complete minors
• Graph minors. XIII: The disjoint paths problem
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
• A unified Erdős-Pósa theorem for constrained cycles
• Obtaining a planar graph by vertex deletion
• A structural characterization of planar combinatorial graphs.
• A \(c^k n\) 5-approximation algorithm for treewidth
• Optimizing the Graph Minors Weak Structure Theorem
• Complexity of Finding Embeddings in a k-Tree
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Dividing a Graph into Triconnected Components
• Modification to Planarity is Fixed Parameter Tractable
• Hitting topological minors is FPT
• The Directed Flat Wall Theorem
• A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
• Planarity Allowing Few Error Vertices in Linear Time
• AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
• Improved Bounds for the Flat Wall Theorem
• Finding topological subgraphs is fixed-parameter tractable
• Parameterized Algorithms
• The Parameterized Complexity of Graph Cyclability

This page was built for publication: A more accurate view of the flat wall theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606321)