Settling the nonorientable genus of the nearly complete bipartite graphs
From MaRDI portal
Publication:6133666
DOI10.1007/s00373-023-02698-wzbMath1521.05036arXiv2305.14048OpenAlexW4385807026MaRDI QIDQ6133666
Publication date: 21 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.14048
Cites Work
- Nonorientable genus of nearly complete bipartite graphs
- Orientable and non orientable genus of the complete bipartite graph
- Quadrangular embeddings of complete graphs and the even map color theorem
- Das Geschlecht des vollständigen paaren Graphen
- The nonorientable genus of complete tripartite graphs
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Settling the nonorientable genus of the nearly complete bipartite graphs