A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2009.08.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078554428 / rank | |||
Normal rank | |||
Revision as of 19:00, 19 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
