Genus bounds for embeddings with large minimum degree and representativity
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.
scientific article; zbMATH DE number 1746285