Euler and bipartite matroids

DOI10.1016/S0021-9800(69)80033-5MaRDI QIDQ5555708zbMATH OpenOpenAlexWikidataFDO

Authors D. J. A. Welsh

Publication date 1969

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(69)80033-5

zbMATH Keywords

binary matroidsbipartite propertyEuler property

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(35)

• A constructive approach to the critical problem for matroids
• The Euler circuit theorem for binary matroids
• König's theorem and bimatroids
• Splitting in a binary matroid
• Eigensets and power products of a bimatroid
• A proof of McKee's Eulerian-bipartite characterization
• Determination of the bases of a splitting matroid
• A characterization of binary Eulerian matroids
• Some results involving the splitting operation on binary matroids
• Coloring drawings of graphs
• Eulerian and bipartite binary delta-matroids
• Matroids are not Ehrhart positive
• Submodular functions and independence structures
• On the Ehrhart polynomial of minimal matroids
• The binary matroids whose only odd circuits are triangles
• Circuit and cocircuit partitions of binary matroids
• Bipartite partial duals and circuits in medial graphs
• On \(n\)-connected minors of the \(es\)-splitting binary matroids
• On dual of the generalized splitting matroids
• scientific article; zbMATH DE number 3298861 (Why is no real title available?)
• scientific article; zbMATH DE number 2230315 (Why is no real title available?)
• Generalization of pinching operation to binary matroids
• Beyond windability: approximability of the four-vertex model
• On bipartite restrictions of binary matroids
• Induced tree covering and the generalized Yutsis property
• Splitting off operation for binary matroids and its applications
• The \(es\)-splitting operation for matroids representable over prime fields \(\mathrm{GF}(p)\)
• A note on connectivity preserving splitting operation for matroids representable over GF(p)
• Dominic Welsh: his work and influence
• Recursive characterization of maximal bipartite planar graphs
• The realizability of theta graphs as reconfiguration graphs of minimum independent dominating sets
• Induced tree covering and the generalized Yutsis property
• Circuit-partition of infinite matroids
• A note on the critical problem for matroids
• Even poset and a parity result for binary linear code

This page was built for publication: Euler and bipartite matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5555708)