On Mighton's characterization of graphic matroids

DOI10.1016/j.jctb.2010.01.005zbMath1203.05030OpenAlexW2091706849MaRDI QIDQ974476

Donald K. Wagner

Publication date: 3 June 2010

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.2010.01.005

zbMATH Keywords

binary matroidsgraphic matroidsgraph realizationavoidance graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Characterizing graphic matroids by a system of linear equations ⋮ Displaying blocking pairs in signed graphs ⋮ A Characterization of Graphic Matroids Based on Circuit Orderings ⋮ Non-separating cocircuits avoiding some elements ⋮ Nonseparating Cocircuits in Binary Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• A new characterization of graphic matroids
• Separating cocircuits in binary matroids
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Converting Linear Programs to Network Problems
• On even matroids

This page was built for publication: On Mighton's characterization of graphic matroids