Path extendability of claw-free graphs
From MaRDI portal
Publication:2501583
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.
Recommendations
Cites work
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- Claw-free graphs---a survey
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graph theory
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- scientific article; zbMATH DE number 1136719 (Why is no real title available?)
- Panconnectivity of locally connected claw-free graphs
Cited in
(8)- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Full cycle extendability of nearly claw-free graphs.
- A property of claw-free graphs
- scientific article; zbMATH DE number 5371683 (Why is no real title available?)
- Extensibility of T₃-confined graphs
- Endpoint extendable paths in dense graphs
- scientific article; zbMATH DE number 1760559 (Why is no real title available?)
- Cycle and path extendability of \(K_{1,3}\)-free join of graphs
This page was built for publication: Path extendability of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501583)
