HHD-free graph

[math]\displaystyle{ HHD }[/math]-free graph --- [math]\displaystyle{ HHD }[/math]-свободный граф.

A graph which does not contain a hole, a house or a domino as an induced subgraph is called a [math]\displaystyle{ HHD }[/math]-free graph. The class of [math]\displaystyle{ HHD }[/math]-free graphs contains such well-known graph classes as chordal graphs and distance-hereditary graphs.