Characterizing graphic matroids by a system of linear equations

DOI10.1016/j.jctb.2013.07.001zbMath1408.05029OpenAlexW1992428436MaRDI QIDQ461731

Bert Gerards, Jim Geelen

Publication date: 13 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2013.07.001

zbMATH Keywords

rank-\(r\) binary matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Notes on a theorem of Naji ⋮ Binary signed-graphic matroids: representations and recognition algorithms ⋮ A Characterization of Graphic Matroids Based on Circuit Orderings ⋮ Nonseparating Cocircuits in Binary Matroids ⋮ A circuit characterization of graphic matroids

Cites Work

• A characterization of circle graphs
• A new characterization of graphic matroids
• On Mighton's characterization of graphic matroids
• Reconnaissance des graphes de cordes
• An efficient PQ-graph algorithm for solving the graph-realization problem
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• Lectures on matroids

This page was built for publication: Characterizing graphic matroids by a system of linear equations