Weakly triangulated graph
Материал из WikiGrapp
Weakly triangulated graph --- слабо триангулируемый граф.
These are graphs without induced cycles of length [math]\displaystyle{ \geq 5 }[/math] or complement of such cycles. It is known that all triangulated-perfect graphs are weakly triangulated.
