A graph is chordal if its cycles with at least four vertices contain at least one edge between two vertices which are not adjacent in the cycle.
i1 : G = graph({{1,2},{2,3},{3,4},{4,1},{2,4}}, EntryMode => "edges"); |
i2 : isChordal G o2 = true |
The object isChordal is a method function.