Vertex pancyclism in claw-free graphs
From MaRDI portal
Publication:1584331
DOI10.1016/S0012-365X(97)00252-5zbMATH Open0957.05063MaRDI QIDQ1584331FDOQ1584331
Authors: Mingchu Li
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory with applications
- Longest paths and cycles in K1,3-free graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Title not available (Why is that?)
- Extending cycles in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Hamiltonicity in claw-free graphs through induced bulls
- Title not available (Why is that?)
- On pancyclic claw-free graphs
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
Cited In (11)
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- Panconnectivity of locally connected claw-free graphs
- Vertex pancyclicity in quasi-claw-free graphs
- Title not available (Why is that?)
- On pancyclic claw-free graphs
- Title not available (Why is that?)
- On the cycle spectrum of cubic Hamiltonian graphs
- Neighborhood unions conditions of pancyclicity in claw-free graphs
- Pancyclicity \(\operatorname{mod}k\) of claw-center-independent graphs
- Vertex pancyclicity in quasi claw-free graphs
- Title not available (Why is that?)
This page was built for publication: Vertex pancyclism in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584331)