How to contract a vertex transitive 5-connected graph
From MaRDI portal
(Redirected from Publication:782134)
Summary: M. Kriesell conjectured that there existed \(b, h\) such that every 5-connected graph \(G\) with at least \(b\) vertices can be contracted to a 5-connected graph \(G_0\) such that \(0<\left| V \left( G\right)\right|-\left( V \left( G_0\right)\right)<h\). We show that this conjecture holds for vertex transitive 5-connected graphs.
Recommendations
- The contractible subgraph of 5-connected graphs
- How to contract an essentially 6-connected graph to a 5-connected graph
- Vertices of degree 5 in a contraction critically 5-connected graph
- Some properties of contraction-critical 5-connected graphs
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
Cites work
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Average degree and contractibility
- Generalizaions of critical connectivity of graphs
- Graph theory with applications
- How to contract an essentially 6-connected graph to a 5-connected graph
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 2230927 (Why is no real title available?)
- Non-separating induced cycles in graphs
- Some properties of contraction-critical 5-connected graphs
- Some structural properties of minimally contraction-critically 5-connected graphs
This page was built for publication: How to contract a vertex transitive 5-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782134)
