The number of contractible edges in 3-connected graphs (Q1111571)
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 number of contractible edges in 3-connected graphs |
scientific article; zbMATH DE number 4075111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of contractible edges in 3-connected graphs |
scientific article; zbMATH DE number 4075111 |
Statements
The number of contractible edges in 3-connected graphs (English)
0 references
1988
0 references
An edge of a 3-connected graph is called contractible if its contraction results in a 3-connected graph. This paper establishes a lower bound of \((2| E(G)| +12)/7\) for contractible edges of every 3-connected graph G.
0 references
3-connected graph
0 references
contractible edges
0 references
0.9575932025909424
0 references
0.917744755744934
0 references
0.9145361185073853
0 references
