Haven (graph theory)
From Wikipedia, the free encyclopedia
In graph theory, if G is a graph, and is an integer, a haven of order k in G is a function assigning to every set
with
a vertex set of a component of
,
, such that if
and
, then
.
The Min-max theorem for tree-width states that a graph has a haven of order k if and only if it has tree width at least k − 1.