2-cell embeddings with prescribed face lengths and genus

DOI10.1007/s00026-011-0075-8zbMath1235.05037OpenAlexW1987443014MaRDI QIDQ659597

Bojan Mohar

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-011-0075-8

zbMATH Keywords

genusmaximum genusdegree sequence2-cell embedding

Mathematics Subject Classification ID

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

Related Items (1)

Face 2-Colorable Embeddings with Faces of Specified Lengths

Cites Work

• How to determine the maximum genus of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-cell embeddings with prescribed face lengths and genus