Panconnectivity of locally connected claw-free graphs
From MaRDI portal
Publication:1301670
DOI10.1016/S0012-365X(99)00010-2zbMath0934.05078OpenAlexW2024359856MaRDI QIDQ1301670
Publication date: 9 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00010-2
Related Items (6)
Constructing the nearly shortest path in crossed cubes ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Hamiltonian connectedness in claw-free graphs ⋮ Cycle and Path Embedding on 5-ary N-cubes ⋮ Path extendability of claw-free graphs ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles of given length in some \(K_{1,3}\)-free graphs
- A note on locally connected and Hamiltonian-connected graphs
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
This page was built for publication: Panconnectivity of locally connected claw-free graphs