Quadrangularly connected claw-free graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2188401 (Why is no real title available?)
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graph theory
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- HamiltonianN2-locally connected claw-free graphs
- On a closure concept in claw-free graphs
- On pancyclic claw-free graphs
Cited in
(7)- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- scientific article; zbMATH DE number 5525657 (Why is no real title available?)
- On Hamiltonicity of 3-connected claw-free graphs
- Vertex pancyclicity of quadrangularly connected claw-free graphs
- On 4-connected claw-free well-covered graphs
- On quadrilaterals and 4-path in claw-free graphs
This page was built for publication: Quadrangularly connected claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870987)