2020/03/03 by Qi Yan, Yan, Qi, Xian’an Jin +1
Computer Science · #05B35 #05C10 #57M15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2003.02125
openalex publication_date 2020/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the concepts of Eulerian and bipartite delta-matroids and then extend the result from embedded graphs to arbitrary binary delta-matroids. The dual of any bipartite embedded graph is Eulerian. We also extend the result from embedded graphs to the class of delta-matroids that arise as twists of binary matroids. Several related results are also obtained.