Definition.An undirected graph is called chordal if every cycle of length greater than three posseses a chord, that is, an edge joining two nonconsecutivevertices of the cycle.

• 定义：无向图中，如果任意边数大于3的环，至少存在一条边连接环中不相邻的某两个点，则称此图为弦图.