Counting and Enumerating Crossing-free Geometric Graphs (Q4635522)
From MaRDI portal
scientific article; zbMATH DE number 6862989
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting and Enumerating Crossing-free Geometric Graphs |
scientific article; zbMATH DE number 6862989 |
Statements
Counting and Enumerating Crossing-free Geometric Graphs (English)
0 references
23 April 2018
0 references
convex partitions
0 references
convex subdivisions
0 references
counting
0 references
crossing-free geometric graphs
0 references
enumerating
0 references
perfect matchings
0 references
spanning cycles
0 references
spanning trees
0 references
triangulations
0 references
