Vertex pancyclism in claw-free graphs
From MaRDI portal
Publication:1584331
Recommendations
Cites work
- scientific article; zbMATH DE number 4191710 (Why is no real title available?)
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Extending cycles in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Graph theory with applications
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Hamiltonicity in claw-free graphs through induced bulls
- Longest paths and cycles in K1,3-free graphs
- On pancyclic claw-free graphs
Cited in
(12)- 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
- scientific article; zbMATH DE number 5844212 (Why is no real title available?)
- On pancyclic claw-free graphs
- Vertex pancyclicity of quadrangularly connected claw-free graphs
- scientific article; zbMATH DE number 5304940 (Why is no real title available?)
- On the cycle spectrum of cubic Hamiltonian graphs
- Neighborhood unions conditions of pancyclicity in claw-free graphs
- Vertex pancyclicity in quasi claw-free graphs
- Pancyclicity \(\operatorname{mod}k\) of claw-center-independent graphs
- scientific article; zbMATH DE number 147642 (Why is no real title available?)
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)
