The 3-connected graphs with exactly \(k\) non-essential edges (Q604648)
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: The 3-connected graphs with exactly k non-essential edges |
scientific article; zbMATH DE number 5815411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 3-connected graphs with exactly \(k\) non-essential edges |
scientific article; zbMATH DE number 5815411 |
Statements
The 3-connected graphs with exactly \(k\) non-essential edges (English)
0 references
12 November 2010
0 references
3-connected graph
0 references
non-essential edge
0 references
Fan
0 references
wheel
0 references
0.9482417702674866
0 references
0.942451536655426
0 references
0.8501526117324829
0 references
0.85007244348526
0 references
0.820320725440979
0 references
