Wang, Jianglu; Zhu, Yongjin Path extensibility of connected, locally 2-connected \(K_{1,3}\)-free graphs. (English) Zbl 0891.05047 Syst. Sci. Math. Sci. 10, No. 3, 267-274 (1997). It is known that every connected, locally 2-connected claw-free graph is panconnected. The authors improve on this result by showing that such a graph is path extendable. That is, for each pair of vertices \(u\), \(v\) and for each non-Hamiltonian \((u,v)\)-path, there is \((u,v)\)-path containing the vertices of \(P\) that is longer by one edge. Reviewer: N.F.Quimpo (Manila) Cited in 1 Document MSC: 05C38 Paths and cycles Keywords:claw-free graph; locally \(k\)-connected; path extendable PDFBibTeX XMLCite \textit{J. Wang} and \textit{Y. Zhu}, Syst. Sci. Math. Sci. 10, No. 3, 267--274 (1997; Zbl 0891.05047)