A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the number of orientable triangular embeddings of some complete graphs |
scientific article |
Statements
A lower bound for the number of orientable triangular embeddings of some complete graphs (English)
0 references
21 April 2010
0 references
Steiner triple system
0 references
Latin square
0 references
complete graph
0 references
triangular embedding
0 references
