On small contractible subgraphs in 3-connected graphs of small average degree (Q2464049)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5218974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On small contractible subgraphs in 3-connected graphs of small average degree |
scientific article; zbMATH DE number 5218974 |
Statements
On small contractible subgraphs in 3-connected graphs of small average degree (English)
0 references
10 December 2007
0 references
The author proves that there exists a smallest number \(k\), \(k>12\), such that every cubic 3-connected graph \(G\) on at least \(k\) vertices has a connected subgraph \(H\) on 5 vertices such that the graph obtained by removing the vertices of \(H\) from \(G\) is 2-connected.
0 references
connectivity
0 references
partition
0 references
contractible
0 references
regular
0 references
average degree
0 references
0 references
0 references
0.8906645
0 references
0.88863623
0 references
0.87532794
0 references
0.87100655
0 references
