Counting and enumerating crossing-free geometric graphs (Q5745385)
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: Counting and enumerating crossing-free geometric graphs |
scientific article; zbMATH DE number 6881121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and enumerating crossing-free geometric graphs |
scientific article; zbMATH DE number 6881121 |
Statements
5 June 2018
0 references
Counting and enumerating crossing-free geometric graphs (English)
0 references
0.9931628704071044
0 references
0.8675169944763184
0 references
0.8622682690620422
0 references
0.8446295261383057
0 references
0.8196146488189697
0 references
