The Euler circuit theorem for binary matroids

DOI10.1016/0095-8956(75)90051-9zbMath0321.05026OpenAlexW2084634114MaRDI QIDQ1223423

Peter J. Wilde

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90051-9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Even poset and a parity result for binary linear code ⋮ Matroids with given restrictions and contractions ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Eulerian and bipartite binary delta-matroids ⋮ Splitting in a binary matroid ⋮ Determination of the bases of a splitting matroid

Cites Work

• Lectures on matroids
• Euler and bipartite matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Euler circuit theorem for binary matroids