Nonorientable genus of nearly complete bipartite graphs

DOI10.1007/BF02187903zbMath0628.05026MaRDI QIDQ1092915

Bojan Mohar

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131042

zbMATH Keywords

edge deletion

Mathematics Subject Classification ID

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

Related Items (4)

Settling the nonorientable genus of the nearly complete bipartite graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Constructing the graphs that triangulate both the torus and the Klein bottle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orientable and non orientable genus of the complete bipartite graph
• Minimal ordered triangulations of surfaces
• The embeddings of a graph—A survey
• Der vollständige paare Graph auf nichtorientierbaren Flächen.

This page was built for publication: Nonorientable genus of nearly complete bipartite graphs