Macaulay2 » Documentation
Packages » Graphs :: isChordal
next | previous | forward | backward | up | index | toc

isChordal -- checks whether a graph is chordal



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

See also

Ways to use isChordal :

For the programmer

The object isChordal is a method function.