Undirected Chordal Graphs

Undirected Chordal Graphs

• An undirected graph is said to be chordal (or triangulated) if every cycle of length > 3 has a chord:

Cycle

Chords

Undirected Graph

Triangulated Undirected Graph

Previous slide

Next slide

Back to the first slide

View Graphic Version