Cyclability of 3-connected graphs
From MaRDI portal
Publication:4500706
Recommendations
- On cycles in 3-connected graphs
- Cyclable sets of vertices in 3-connected graphs
- scientific article; zbMATH DE number 3916305
- scientific article; zbMATH DE number 3929042
- On the number of cycles in 3-connected cubic graphs
- On the cyclability of graphs
- Cycles in oriented 3-graphs
- Long cycles in 3-connected graphs
- scientific article; zbMATH DE number 3937201
- Long cycles in 3-cyclable graphs
Cites work
Cited in
(18)- A degree sum condition concerning the connectivity and the independence number of a graph
- A look at cycles containing specified elements of a graph
- Cycles through three vertices in 2-connected graphs
- On cycles in 3-connected graphs
- Neighborhood unions and cyclability of graphs
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Recent advances on the Hamiltonian problem: survey III
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Cyclable sets of vertices in 3-connected graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- Graphs with cyclomatic number three having panconnected square
- scientific article; zbMATH DE number 1443137 (Why is no real title available?)
- A \(k\)-tree containing specified vertices
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- Edge bounds in nonhamiltonian k-connected graphs
- The k-dominating cycles in graphs
- Hamiltonicity of 4-connected graphs
This page was built for publication: Cyclability of 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500706)