Reductions of 3-connected graphs with minimum degree at least four (Q3177643)
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: Reductions of 3-connected graphs with minimum degree at least four |
scientific article; zbMATH DE number 6912164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reductions of 3-connected graphs with minimum degree at least four |
scientific article; zbMATH DE number 6912164 |
Statements
Reductions of 3-connected graphs with minimum degree at least four (English)
0 references
1 August 2018
0 references
3-connected graph
0 references
cyclically 4-edge connected graph
0 references
minimum degree
0 references
contraction
0 references
minor inclusion
0 references
0.9146780967712402
0 references
0.8246021866798401
0 references
0.8087614178657532
0 references
0.8056296110153198
0 references
