Vertex pancyclism in claw-free graphs
From MaRDI portal
Publication:1584331
DOI10.1016/S0012-365X(97)00252-5zbMath0957.05063MaRDI QIDQ1584331
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending cycles in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Hamiltonicity in claw-free graphs through induced bulls
- Longest paths and cycles in K1,3-free graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
This page was built for publication: Vertex pancyclism in claw-free graphs