Bounds on the maximum multiplicity of some common geometric graphs (Q2848539)
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 6212010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the maximum multiplicity of some common geometric graphs |
scientific article; zbMATH DE number 6212010 |
Statements
26 September 2013
0 references
geometric graph
0 references
noncrossing property
0 references
Hamiltonian cycle
0 references
perfect matching
0 references
triangulation
0 references
spanning tree
0 references
Bounds on the maximum multiplicity of some common geometric graphs (English)
0 references
0.9905245304107666
0 references
0.8315923810005188
0 references
0.818419873714447
0 references
0.8073397874832153
0 references
0.7931056022644043
0 references
