Partial duality for ribbon graphs. III: A gray code algorithm for enumeration (Q825536)
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: Partial duality for ribbon graphs. III: A gray code algorithm for enumeration |
scientific article; zbMATH DE number 7447672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial duality for ribbon graphs. III: A gray code algorithm for enumeration |
scientific article; zbMATH DE number 7447672 |
Statements
Partial duality for ribbon graphs. III: A gray code algorithm for enumeration (English)
0 references
17 December 2021
0 references
ribbon graph
0 references
partial duality
0 references
Poincaré dual
0 references
Petrie dual
0 references
rotation system
0 references
Euler-genus
0 references
genus polynomial
0 references
Gray code
0 references
0 references
0 references
0.880583643913269
0 references
0.8299781084060669
0 references
0.7926838397979736
0 references
0.7921135425567627
0 references
0.7907004356384277
0 references
