  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.
