The largest demigenus over all signatures on K₃,n

DOI10.1007/S00373-013-1370-4zbMATH Open1306.05086OpenAlexW2073346589MaRDI QIDQ489355FDOQ489355

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

signed graphcomplete bipartite graphdemigenusorientation embedding

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)

Cites Work

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

Cited In (3)

• Orientation embedding of signed graphs
• The smallest surface that contains all signed graphs on \(K_{4, n}\)
• The largest demigenus of a bipartite signed graph

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)