Settling the nonorientable genus of the nearly complete bipartite graphs
From MaRDI portal
Publication:6133666
DOI10.1007/S00373-023-02698-WzbMATH Open1521.05036arXiv2305.14048OpenAlexW4385807026MaRDI QIDQ6133666FDOQ6133666
Authors: Warren Singh, Timothy Sun 
Publication date: 21 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the partite classes differ by at most one, and a maximum matching is deleted. We resolve these missing cases using three classic tools for constructing genus embeddings of the complete bipartite graphs: current graphs, diamond sums, and the direct rotation systems of Ringel.
Full work available at URL: https://arxiv.org/abs/2305.14048
Recommendations
Cites Work
- Title not available (Why is that?)
- Orientable and non orientable genus of the complete bipartite graph
- The nonorientable genus of complete tripartite graphs
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Title not available (Why is that?)
- Das Geschlecht des vollständigen paaren Graphen
- Nonorientable genus of nearly complete bipartite graphs
- Title not available (Why is that?)
- Quadrangular embeddings of complete graphs and the even map color theorem
Cited In (5)
- Title not available (Why is that?)
- Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- Nonorientable genus of nearly complete bipartite graphs
- On the orientable genus of graphs with bounded nonorientable genus
This page was built for publication: Settling the nonorientable genus of the nearly complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133666)
