ConceptTheory & Algos
Chordal graph
A graph is chordal if every cycle in the graph of length four or greater has a chord connecting non-adjacent vertices.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
5The lectures that define it or assume it, and the concepts next to it.