Circumferences of regular claw-free graphs
From MaRDI portal
Publication:2433725
Recommendations
Cites work
- Dominating cycles in regular 3-connected graphs
- Graph theory with applications
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian cycles in regular 3-connected claw-free graphs
- scientific article; zbMATH DE number 3902690 (Why is no real title available?)
- scientific article; zbMATH DE number 147639 (Why is no real title available?)
- Longest cycles in regular 2-connected claw-free graphs
- Longest cycles in regular graphs
- Longest paths and cycles in K1,3-free graphs
- On a closure concept in claw-free graphs
Cited in
(12)- Circumferences and minimum degrees in 3-connected claw-free graphs
- Longest cycles in regular 2-connected claw-free graphs
- Circumferences of 3-connected claw-free graphs. II.
- Circumferences of 3-connected claw-free graphs
- The degree-diameter problem for claw-free graphs and hypergraphs
- scientific article; zbMATH DE number 5914889 (Why is no real title available?)
- scientific article; zbMATH DE number 4212091 (Why is no real title available?)
- scientific article; zbMATH DE number 193589 (Why is no real title available?)
- scientific article; zbMATH DE number 1766873 (Why is no real title available?)
- scientific article; zbMATH DE number 1766878 (Why is no real title available?)
- scientific article; zbMATH DE number 238370 (Why is no real title available?)
- On 2-factors with long cycles in 3-connected claw-free graphs
This page was built for publication: Circumferences of regular claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433725)