How to contract a vertex transitive 5-connected graph (Q782134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to contract a vertex transitive 5-connected graph |
scientific article; zbMATH DE number 7224174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to contract a vertex transitive 5-connected graph |
scientific article; zbMATH DE number 7224174 |
Statements
How to contract a vertex transitive 5-connected graph (English)
0 references
22 July 2020
0 references
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.
0 references
0 references
