Maximum hexagon packing of \(K_v-L\) where \(L\) is a 2-regular subgraph. (Q2936667)
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 6383817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum hexagon packing of \(K_v-L\) where \(L\) is a 2-regular subgraph. |
scientific article; zbMATH DE number 6383817 |
Statements
6 January 2015
0 references
6-cycle
0 references
complete graph
0 references
maximum packing
0 references
0.7936739921569824
0 references
0.78035569190979
0 references
0.7796769142150879
0 references
