Almost-graphic matroids

DOI10.1006/AAMA.2001.0791MaRDI QIDQ696817zbMATH OpenOpenAlexFDO

Authors S. R. Kingan, Manoel Lemos

Publication date 12 September 2002

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

Full work available at URL https://semanticscholar.org/paper/2cf8ada44e92ecaf6c09c2ed11d52ee450292341

zbMATH Keywords

almost graphic matroidbinary matroidplanar graphregular matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

A matroid which is not graphic is termed almost graphic if, for each element of the matroid, either the matroid obtained by deletion of the element is graphic, or the matroid obtained by contraction of the element is graphic. In this paper, the almost graphic matroids are explicitly determined, thereby solving a problem of James Oxley. Additionally, a characterization of the ``almost regular matroids having at least one regular element is given.

Recommendations

• A decomposition theory for matroids. VI: Almost regular matroids
• On Tutt's Characterization of graphic matroids—a graphic proof
• scientific article; zbMATH DE number 4145915
• scientific article; zbMATH DE number 1161308
• A note on nongraphic matroids

Cites work

• A characterization of a class of non-binary matroids
• A Characterization of Almost-Planar Graphs
• An extension of Lindström's result about characteristic sets of matroids
• Binary matroids without prisms, prism duals, and cubes
• Decomposition of regular matroids
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• scientific article; zbMATH DE number 1161308 (Why is no real title available?)
• On the structure of 3-connected matroids and graphs
• The Binary Matroids With No 4-Wheel Minor

Cited in

(20)

• Internally 4-connected binary matroids with cyclically sequential orderings
• A decomposition theory for matroids. VI: Almost regular matroids
• On almost-planar graphs
• The Möbius matroids
• Gorenstein graphic matroids
• An algorithm for delta-wye reduction of almost-planar graphs
• Fan-extensions in fragile matroids
• Signed-graphic matroids with all-graphic cocircuits
• A circuit characterization of graphic matroids
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
• A particular class of graphic matroids
• scientific article; zbMATH DE number 4145915 (Why is no real title available?)
• Stability, fragility, and Rota's conjecture
• Matroids with at least two regular elements
• scientific article; zbMATH DE number 1161308 (Why is no real title available?)
• Delta-wye reduction of almost-planar graphs
• scientific article; zbMATH DE number 1409215 (Why is no real title available?)
• Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
• Towards a splitter theorem for internally 4-connected binary matroids. VII

This page was built for publication: Almost-graphic matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696817)