Chordal graph¶
Every undirected cycle X1−X2⋯Xk−X1 of length k≥4 has a chord.
Chord is an edge that is not part of the cycle but connects two vertices of the cycle
Example of a chord. The green edges are not part of a cycle.
Every undirected cycle X1−X2⋯Xk−X1 of length k≥4 has a chord.
Chord is an edge that is not part of the cycle but connects two vertices of the cycle
Example of a chord. The green edges are not part of a cycle.