Contractible cycles in graphs with large minimum degree (Q1363691)
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: Contractible cycles in graphs with large minimum degree |
scientific article; zbMATH DE number 1047082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Contractible cycles in graphs with large minimum degree |
scientific article; zbMATH DE number 1047082 |
Statements
Contractible cycles in graphs with large minimum degree (English)
0 references
10 August 1997
0 references
It is proved that if \(k\geq 2\), then with the exception of \(K_4\) and \(K_5\), every \(k\)-connected graph \(G\) of minimum degree at least \([3k/2]\) contains an induced cycle \(C\) such that \(G-V(C)\) is \((k-1)\)-connected.
0 references
contractible cycles
0 references
\(k\)-connected graph
0 references
minimum degree
0 references
0.9011327028274536
0 references
0.8530285954475403
0 references
0.8503690361976624
0 references
