Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles (Q1756041)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7000610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles |
scientific article; zbMATH DE number 7000610 |
Statements
Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles (English)
0 references
11 January 2019
0 references
4-connected graph
0 references
contractible edge
0 references
triangle
0 references
0 references
0 references
0 references
0.96204394
0 references
0.9606794
0 references
0 references
0 references
0.9432882
0 references
0.94014245
0 references
0.93149644
0 references
0.9100339
0 references
