New characterizations of Eulerian and bipartite binary matroids
From MaRDI portal
We give only the main results of the paper. A binary matroid is Eulerian if and only if it satisfies one of the following equivalent conditions: (i) every of its elements is contained in an odd number of circuits; (ii) the ground set of the matroid has an odd number of partitions into circuits. The corresponding results for bipartite binary matroids are derived from them.
Recommendations
Cited in
(13)- Elementary proofs of (relatively) recent characterizations of Eulerian graphs
- An extension of elementary bipartite graphs to matroid pairs and its characterization
- Counting maximal cycles in binary matroids
- Bipartite and Eulerian minors
- A proof of McKee's Eulerian-bipartite characterization
- A characterization of binary Eulerian matroids
- Eulerian and bipartite binary delta-matroids
- Eulerian and bipartite orientable matroids
- scientific article; zbMATH DE number 4023303 (Why is no real title available?)
- scientific article; zbMATH DE number 1174445 (Why is no real title available?)
- scientific article; zbMATH DE number 3995703 (Why is no real title available?)
- On bipartite restrictions of binary matroids
- Even poset and a parity result for binary linear code
This page was built for publication: New characterizations of Eulerian and bipartite binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936386)
