Settling the nonorientable genus of the nearly complete bipartite graphs

DOI10.1007/S00373-023-02698-WMaRDI QIDQ6133666zbMATHOpenAlexFDO

Authors Warren Singh, Timothy Sun

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

zbMATH Keywords

current graphtopological graph theoryquadrangular embeddingdiamond sum

Mathematics Subject Classification ID

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

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.

Recommendations

• Nonorientable genus of nearly complete bipartite graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• scientific article; zbMATH DE number 3939383
• Publication:4863472
• The nonorientable genus of the join of two cycles

Cites work

• scientific article; zbMATH DE number 3939383 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3697143 (Why is no real title available?)
• Das Geschlecht des vollständigen paaren Graphen
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• 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
• The nonorientable genus of complete tripartite graphs

Cited in

(5)

• Nonorientable genus of nearly complete bipartite graphs
• scientific article; zbMATH DE number 3939383 (Why is no real title available?)
• On the orientable genus of graphs with bounded nonorientable genus
• Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
• Counterexamples to the nonorientable genus conjecture for complete tripartite graphs

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)