.
is chordal, that is, for every simple cycle of more than 3
vertices in
G'
, there is some edge in
E'
that is not involved in the
cycle but that joins two vertices in the cycle.
[
232
].
for graphs with bounded
degree [
232
].
Viggo Kann