Path extendability of claw-free graphs
From MaRDI portal
Publication:2501583
DOI10.1016/J.DISC.2006.03.057zbMATH Open1113.05057OpenAlexW2012935677MaRDI QIDQ2501583FDOQ2501583
Authors: Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu
Publication date: 14 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.057
Recommendations
Cites Work
- Graph theory
- Claw-free graphs---a survey
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Title not available (Why is that?)
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- Panconnectivity of locally connected claw-free graphs
- Title not available (Why is that?)
Cited In (7)
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)