c = isChordal G
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.


The object isChordal is a method function.