Distance-hereditary graph

Distance-hereditary graph --- дистанционно-наследуемый граф.

A graph is distance-hereditary graph if the distance stays the same between any of two vertices in every connected induced subgraph containing both. distance-hereditary graph form a subclass of perfect graphs. Two well-known classes of graphs, trees and cographs, both belong to distance-hereditary graph.