The minimum number of triangles covering the edges of a graph (Q3201088)
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: Publication:3201088 |
scientific article; zbMATH DE number 4177099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum number of triangles covering the edges of a graph |
scientific article; zbMATH DE number 4177099 |
Statements
The minimum number of triangles covering the edges of a graph (English)
0 references
1989
0 references
triangle covering
0 references
finite simple graphs
0 references
0.7985415458679199
0 references
0.7883985638618469
0 references
0.7867896556854248
0 references
0.7810209393501282
0 references
0.78030925989151
0 references
