Counting maximal cycles in binary matroids

DOI10.1016/0012-365X(95)00240-WzbMath0870.05014MaRDI QIDQ1356679

O. Diekmann

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

circuitsbinary matroidEulerianmaximal cycles

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Even poset and a parity result for binary linear code ⋮ Parity and disparity subgraphs

Cites Work

• A proof of McKee's Eulerian-bipartite characterization
• Unnamed Item

This page was built for publication: Counting maximal cycles in binary matroids