Maximum genus of a graph in terms of its embedding properties.

DOI10.1016/S0012-365X(02)00497-1zbMath1055.05037OpenAlexW1991331537MaRDI QIDQ1868846

Yuan Qiu Huang

Publication date: 28 April 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00497-1

zbMATH Keywords

Maximum genusFaceBetti deficiencyDual graph

Mathematics Subject Classification ID

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

Related Items (1)

Fundamental cycles and graph embeddings

This page was built for publication: Maximum genus of a graph in terms of its embedding properties.