Obstructions to a binary matroid being graphic
From MaRDI portal
Publication:2275474
DOI10.1016/J.EJC.2011.01.015zbMATH Open1229.05074OpenAlexW2103500475MaRDI QIDQ2275474FDOQ2275474
Authors: Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu 
Publication date: 9 August 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.01.015
Recommendations
Cites Work
- Decomposition of regular matroids
- A characterization of graphic matroids using non-separating cocircuits
- Characterizing 3-connected planar graphs and graphic matroids
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Draw a Graph
- Stabilizers of classes of representable matroids
- Title not available (Why is that?)
- On Vertex-Triads in 3-Connected Binary Matroids
- Non-separating cocircuits in matroids
- Non-separating cocircuits in binary matroids
- Title not available (Why is that?)
- Connected hyperplanes in binary matroids
Cited In (7)
- A new characterization of graphic matroids
- Connected hyperplanes in binary matroids
- Triples in matroid circuits
- A characterization of graphic matroids using non-separating cocircuits
- Characterizing 3-connected planar graphs and graphic matroids
- On 3-connected minors of 3-connected matroids and graphs
- Obstructions to a general characterization of graph correspondences
This page was built for publication: Obstructions to a binary matroid being graphic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275474)
