The largest demigenus over all signatures on K₃,n
From MaRDI portal
Publication:489355
Recommendations
Cites work
- A Coding Approach to Signed Graphs
- Characterization of the maximum genus of a signed graph
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Duke's theorem does not extend to signed graph embeddings
- Generalized Embedding Schemes
- Graph theory with applications
- Graphs on surfaces
- scientific article; zbMATH DE number 3939383 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 1409183 (Why is no real title available?)
- Minimal ordered triangulations of surfaces
- Orientable and non orientable genus of the complete bipartite graph
- Orientation embedding of signed graphs
- The largest demigenus of a bipartite signed graph
- The largest parity demigenus of a simple graph
- The order upper bound on parity embedding of a graph
Cited in
(4)
This page was built for publication: The largest demigenus over all signatures on \(K_{3,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489355)