The largest demigenus over all signatures on \(K_{3,n}\)

DOI10.1007/s00373-013-1370-4zbMath1306.05086OpenAlexW2073346589MaRDI QIDQ489355

Shengxiang Lv

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1370-4

zbMATH Keywords

complete bipartite graphorientation embeddingsigned graphdemigenus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The smallest surface that contains all signed graphs on \(K_{4, n}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of the maximum genus of a signed graph
• Duke's theorem does not extend to signed graph embeddings
• Orientable and non orientable genus of the complete bipartite graph
• The largest parity demigenus of a simple graph
• The order upper bound on parity embedding of a graph
• Minimal ordered triangulations of surfaces
• Orientation embedding of signed graphs
• Generalized Embedding Schemes
• A Coding Approach to Signed Graphs
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• The largest demigenus of a bipartite signed graph

This page was built for publication: The largest demigenus over all signatures on \(K_{3,n}\)