The largest parity demigenus of a simple graph

DOI10.1006/jctb.1997.1766zbMath0890.05024OpenAlexW1982325811MaRDI QIDQ1362103

Thomas Zaslavsky

Publication date: 12 August 1997

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

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

zbMATH Keywords

surfacegenusparity embedding

Mathematics Subject Classification ID

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

Related Items (3)

The smallest surface that contains all signed graphs on \(K_{4, n}\) ⋮ The largest demigenus over all signatures on \(K_{3,n}\) ⋮ Branch points of area-minimizing projective planes and a question of Courant

Cites Work

• Combinatorics of orientation reversing polygons
• Minimal quadrangulations of nonorientable surfaces
• The order upper bound on parity embedding of a graph
• The projective-planar signed graphs
• Das Geschlecht des vollständigen paaren Graphen
• Orientation embedding of signed graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The largest parity demigenus of a simple graph