Abstract
We introduce a supporting combinatorial framework for the Flat Wall Theorem. In particular, we suggest two variants of the theorem and we introduce a new, more versatile, concept of wall homogeneity as well as the notion of regularity in flat walls. All proposed concepts and results aim at facilitating the use of the irrelevant vertex technique in future algorithmic applications.
Original language | English (US) |
---|---|
Pages (from-to) | 263-297 |
Number of pages | 35 |
Journal | Journal of Graph Theory |
Volume | 107 |
Issue number | 2 |
DOIs | |
State | Published - Oct 2024 |
Keywords
- Flat Wall Theorem
- graph minors
- homogeneous walls
- irrelevant vertex technique
- parameterized algorithms
- treewidth
ASJC Scopus subject areas
- Geometry and Topology
- Discrete Mathematics and Combinatorics