Weakly chordal graph
Материал из WikiGrapp
Weakly chordal graph --- слабо хордальный граф.
A graph [math]\displaystyle{ G }[/math] is called a weakly chordal graph if [math]\displaystyle{ G }[/math] and [math]\displaystyle{ \bar{G} }[/math] contain no induced [math]\displaystyle{ C_{k}, k \geq 5 }[/math]. It is known that the class of chordal graphs is contained in the class of weakly chordal graphs and the class of weakly chordal graphs is contained in the class of perfect graphs.
