Rautenbach, Dieter Graphs with small additive stretch number. (English) Zbl 1062.05053 Discuss. Math., Graph Theory 24, No. 2, 291-301 (2004). Which undirected graphs contain a pair of vertices which may be linked by two induced paths (i.e. without other inner links than those of the path) differing by more than \(k\) edges? A complete answer is obtained for \(k=1\) and \(k=2\) in terms of containing some induced subgraph belonging to a structurally described set of graphs. From this a complete set of minimal induced subgraphs may be derived, but is not explicited. Reviewer: Frank Plastria (Brussels) Cited in 4 Documents MSC: 05C12 Distance in graphs 05C75 Structural characterization of families of graphs Keywords:distance hereditary graph; forbidden subgraph PDFBibTeX XMLCite \textit{D. Rautenbach}, Discuss. Math., Graph Theory 24, No. 2, 291--301 (2004; Zbl 1062.05053) Full Text: DOI Link