Reduction for 3-connected graphs of minimum degree at least four (Q2373428)
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: Reduction for 3-connected graphs of minimum degree at least four |
scientific article; zbMATH DE number 5172573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduction for 3-connected graphs of minimum degree at least four |
scientific article; zbMATH DE number 5172573 |
Statements
Reduction for 3-connected graphs of minimum degree at least four (English)
0 references
19 July 2007
0 references
3-Connected graph
0 references
Minimum degree
0 references
Contraction
0 references
Splitting
0 references
Crown
0 references
Crown reduction
0 references
0 references
0.9146780967712402
0 references
0.821929931640625
0 references
0.7812516093254089
0 references
0.7773135900497437
0 references
0.7728683948516846
0 references
