Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700)
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: Trinque problem: covering complete graphs by plane degree-bounded hypergraphs |
scientific article; zbMATH DE number 6687848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trinque problem: covering complete graphs by plane degree-bounded hypergraphs |
scientific article; zbMATH DE number 6687848 |
Statements
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (English)
0 references
22 February 2017
0 references
plane hypergraph
0 references
edge covering
0 references
complete graphs
0 references
edge partition
0 references
0.759161114692688
0 references
0.73036789894104
0 references
0.7265315651893616
0 references
0.7254295945167542
0 references
0.7204880714416504
0 references
