Path extendability of claw-free graphs (Q2501583): Difference between revisions

The authors prove the following result. Let \(G\) be a connected, locally connected, claw-free graph of order \(n\) and \(x,y\) be any two vertices of \(G\). If for any 2-cut \(S\), \(S\cap\{x,y\}=\emptyset\), then each \((x,y)\)-path of length less than \(n-1\) of \(G\) is extendable. This generalizes several related results known before.