Minimally contraction-critically 6-connected graphs
From MaRDI portal
Publication:658121
Recommendations
- Vertices of degree 6 in a contraction critically 6-connected graph
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Some structural properties of minimally contraction-critically 5-connected graphs
- Vertices of degree 6 in a 6-contraction critical graph
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3600073 (Why is no real title available?)
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Uncontractable 4-connected graphs
- Vertices of degree 6 in a contraction critically 6-connected graph
Cited in
(6)- How to contract an essentially 6-connected graph to a 5-connected graph
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- Vertices of degree 6 in a 6-contraction critical graph
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- Vertices of degree 6 in a contraction critically 6-connected graph
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
This page was built for publication: Minimally contraction-critically 6-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658121)