Cycles through edges in cyclically k-connected cubic graphs
From MaRDI portal
(Redirected from Publication:1196754)
Cycles through edges in cyclically \(k\)-connected cubic graphs
Cycles through edges in cyclically \(k\)-connected cubic graphs
Recommendations
- Cycles in cube-connected cycles graphs
- Cycles in the cube-connected cycles graph
- Cycles through four edges in 3-connected cubic graphs
- scientific article; zbMATH DE number 3966114
- Cycles in cubic graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Algorithm Theory - SWAT 2004
- Cycles through k+2 vertices in k-connected graphs
- Uniform cyclic edge connectivity in cubic graphs
- Cycles through five edges in 3-connected cubic graphs
Cites work
Cited in
(15)- A look at cycles containing specified elements of a graph
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Cyclically five-connected cubic graphs
- scientific article; zbMATH DE number 4177105 (Why is no real title available?)
- scientific article; zbMATH DE number 4181377 (Why is no real title available?)
- Cycles passing throughk + 1 vertices ink-connected graphs
- scientific article; zbMATH DE number 57416 (Why is no real title available?)
- scientific article; zbMATH DE number 68913 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- Splitter Theorems for Cubic Graphs
- Cycles through five edges in 3-connected cubic graphs
- Extremal spectral radius of graphs with cyclic edge-connectivity
- Cycles through four edges in 3-connected cubic graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
This page was built for publication: Cycles through edges in cyclically \(k\)-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196754)