The order upper bound on parity embedding of a graph

DOI10.1006/jctb.1996.0060zbMath0856.05030OpenAlexW2001584690MaRDI QIDQ1924161

Thomas Zaslavsky

Publication date: 17 February 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6e8cb4063e66b0605b3fb319bb59177d0a04f594

zbMATH Keywords

surfacecompact surfacecrosscapshandlesparity embeddingantipodal surface embedding

Mathematics Subject Classification ID

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

Related Items (4)

The largest parity demigenus of a simple graph ⋮ The smallest surface that contains all signed graphs on \(K_{4, n}\) ⋮ The largest demigenus over all signatures on \(K_{3,n}\) ⋮ Generalized thrackle drawings of non-bipartite graphs

This page was built for publication: The order upper bound on parity embedding of a graph