Genus bounds for embeddings with large minimum degree and representativity

DOI10.1016/S0012-365X(01)00243-6MaRDI QIDQ1598852zbMATH OpenOpenAlexFDO

Authors Michael D. Plummer, Xiaoya Zha

Publication date 28 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00243-6

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

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.

Recommendations

• Maximum genus, connectivity and minimal degree of graphs
• Maximum genus and girth of graphs
• Maximum genus embeddings and genus embeddings on orientable surfaces
• scientific article; zbMATH DE number 16301
• On minimum-genus embeddings

Cited in

(4)

• Maximum genus of strong embeddings
• Constructing all minimum genus embeddings of
• Bounds for isoperimetric constants of infinite plane graphs
• Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)

This page was built for publication: Genus bounds for embeddings with large minimum degree and representativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598852)