Almost all 3-connected graphs contain a contractible set of \(k\) vertices (Q1850571)
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: Almost all 3-connected graphs contain a contractible set of k vertices |
scientific article; zbMATH DE number 1843796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all 3-connected graphs contain a contractible set of \(k\) vertices |
scientific article; zbMATH DE number 1843796 |
Statements
Almost all 3-connected graphs contain a contractible set of \(k\) vertices (English)
0 references
10 December 2002
0 references
connectivity
0 references
contractable subgraph
0 references
longest induced path
0 references
longest cycle
0 references
connected subgraph
0 references
0.8926798701286316
0 references
0.88467937707901
0 references
0.884678840637207
0 references
0.8589891791343689
0 references
0.8352853059768677
0 references
