Nonorientable genus of nearly complete bipartite graphs
From MaRDI portal
Publication:1092915
DOI10.1007/BF02187903zbMath0628.05026MaRDI QIDQ1092915
Publication date: 1988
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131042
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
This page was built for publication: Nonorientable genus of nearly complete bipartite graphs