On an extension of distance hereditary graphs (Q1025561)

A graph \(G\) is \(k\)-distance hereditary if and only if for any connected induced subgraph \(H\) of \(G\) the distance between any two vertices in \(H\) is at most \(k\) more than the distance between the same vertices in \(G\). The authors give a forbidden subgraph characterization of such graphs using the chord distance in cycles the the dilation number of a graph.