Local structure of 7- and 8-connected graphs
From MaRDI portal
Publication:2256706
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3600073 (Why is no real title available?)
- scientific article; zbMATH DE number 1960407 (Why is no real title available?)
- scientific article; zbMATH DE number 3308124 (Why is no real title available?)
- scientific article; zbMATH DE number 2230927 (Why is no real title available?)
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- A local structure theorem on 5-connected graphs
- A recursive characterization of the 4-connected graphs
- A theorem on n-connected graphs
- Contractible edges in 7-connected graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Nonseparating cycles inK-Connected graphs
- Some properties of contraction-critical 5-connected graphs
- The number of vertices of degree 7 in a contraction-critical 7-connected graph
- Vertices of degree 6 in a contraction critically 6-connected graph
This page was built for publication: Local structure of 7- and 8-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256706)