On the circumference of 2-connected P₃-dominated graphs
From MaRDI portal
Publication:1014832
Recommendations
Cites work
- Cycles and Connectivity in Graphs
- Graph theory with applications
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Hamiltonicity in 2-connected claw-free graphs
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Hamiltonicity of 3-connected quasi-claw-free graphs.
- scientific article; zbMATH DE number 5914889 (Why is no real title available?)
- scientific article; zbMATH DE number 147639 (Why is no real title available?)
- Longest paths joining given vertices in a graph
- On hamiltonicity of \(P_{3}\)-dominated graphs
- On the circumference of 3-connected quasi-claw-free graphs
- Quasi-claw-free graphs
Cited in
(4)
This page was built for publication: On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014832)