Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470)
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: Dihedral biembeddings and triangulations by complete and complete tripartite graphs |
scientific article; zbMATH DE number 6189467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dihedral biembeddings and triangulations by complete and complete tripartite graphs |
scientific article; zbMATH DE number 6189467 |
Statements
Dihedral biembeddings and triangulations by complete and complete tripartite graphs (English)
0 references
19 July 2013
0 references
complete tripartite graph
0 references
dihedral group
0 references
embedding
0 references
biembeddings of Latin squares
0 references
Cayley tables
0 references
0 references
0 references
0 references
0 references
0 references
0.9035546779632568
0 references
0.8959214091300964
0 references
0.8712720274925232
0 references
0.8546873331069946
0 references
0.8455557823181152
0 references
