Eulerian and bipartite binary delta-matroids
From MaRDI portal
Publication:2087657
DOI10.1007/s10255-022-1014-7zbMath1502.05028arXiv2003.02125OpenAlexW4287829623MaRDI QIDQ2087657
Publication date: 21 October 2022
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.02125
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Bipartite partial duals and circuits in medial graphs
- The group structure of pivot and loop complementation on graphs and set systems
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- The Euler circuit theorem for binary matroids
- Plane graphs with Eulerian Petrie walks
- A characterization of binary Eulerian matroids
- Matroids, delta-matroids and embedded graphs
- Maps and \(\Delta\)-matroids
- Twisted duality for embedded graphs
- Greedy algorithm and symmetric matroids
- Graphs on Surfaces
- Euler and bipartite matroids
- On the interplay between embedded graphs and delta-matroids
- New characterizations of Eulerian and bipartite binary matroids
This page was built for publication: Eulerian and bipartite binary delta-matroids