chordal (379B)
1 # Chordal 2 3 https://en.wikipedia.org/wiki/Chordal_graph 4 5 An [undirected_graph] is *chordal* if every [cycle] of length at least 4 has a [chord] 6 7 Equivalently, an [undirected_graph] is chordal iff it has a [perfect_elimination_ordering]: 8 - can be found in [linear_time] with [lexicographic_breadth_first_search] 9 10 See also: [hypergraph_chordal], [proper_chordal_graph] 11 12 Up: [graph]