The binary matroids whose only odd circuits are triangles

DOI10.1016/j.aam.2016.01.006zbMath1334.05023OpenAlexW2276677606MaRDI QIDQ272893

Kristen Wetzler, James G. Oxley

Publication date: 21 April 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2016.01.006

zbMATH Keywords

bipartiteEulerian graphaffine binary matroidodd circuit

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The binary matroids with no odd circuits of size exceeding five ⋮ An upper bound for the circumference of a 3-connected binary matroid

Cites Work

• Kernels in perfect line-graphs
• Euler and bipartite matroids
• A Combinatorial Model for Series-Parallel Networks
• A Decomposition for Combinatorial Geometries
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The binary matroids whose only odd circuits are triangles