C-Chordal graph

[math]\displaystyle{ c }[/math]-Chordal graph — [math]\displaystyle{ c }[/math]-хордальный граф.

A graph is [math]\displaystyle{ c }[/math]-chordal graph if every induced cycle in it is of length at most [math]\displaystyle{ c }[/math]. Triangulated graphs are precisely 3-chordal graphs.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.