Genus bounds for embeddings with large minimum degree and representativity (Q1598852): 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/s0012-365x(01)00243-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091942016 / rank | |||
Normal rank | |||
Latest revision as of 12:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genus bounds for embeddings with large minimum degree and representativity |
scientific article |
Statements
Genus bounds for embeddings with large minimum degree and representativity (English)
0 references
28 May 2002
0 references
The authors establish some inequalities involving the minimum degree, the representativity, and the genus of a graph on a surface. In particular, if the minimum degree is at least \(7\), then the representativity is bounded above by the logarithm of the genus.
0 references
