The order upper bound on parity embedding of a graph

DOI10.1006/JCTB.1996.0060MaRDI QIDQ1924161zbMATH OpenOpenAlexFDO

Authors 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

surfacecrosscapshandlescompact surfaceparity embeddingantipodal surface embedding

Mathematics Subject Classification ID

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

Recommendations

• The largest parity demigenus of a simple graph
• Even embeddings of the complete graphs and their cycle parities
• Combinatorics of orientation reversing polygons
• The smallest surface that contains all signed graphs on \(K_{4, n}\)

Cited in

(6)

• Even embeddings of the complete graphs and their cycle parities
• Generalized thrackle drawings of non-bipartite graphs
• Combinatorics of orientation reversing polygons
• The largest demigenus over all signatures on \(K_{3,n}\)
• The smallest surface that contains all signed graphs on \(K_{4, n}\)
• The largest parity demigenus of a simple graph

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

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