Almost-graphic matroids
type: Item
instance of: scholarly article
title: Almost-graphic matroids
zbMATH Open document ID: 1010.05017
author: S. R. Kingan
author: Manoel Lemos
published in: Advances in Applied Mathematics
publication date: 2002-09-12T00:00:00Z
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.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1800217
zbMATH Keywords: almost graphic matroid
zbMATH Keywords: regular matroid
zbMATH Keywords: binary matroid
zbMATH Keywords: planar graph
reviewed by: James F. Lawrence
MaRDI profile type: Publication
OpenAlex ID: W2053279811
cites work: A Characterization of Almost-Planar Graphs
cites work: An extension of Lindström's result about characteristic sets of matroids
cites work: Binary matroids without prisms, prism duals, and cubes
cites work: Q4393302
cites work: The Binary Matroids With No 4-Wheel Minor
cites work: A characterization of a class of non-binary matroids
cites work: Q3135082
cites work: On the structure of 3-connected matroids and graphs
cites work: Decomposition of regular matroids
cites work: Q4004142
cites work: Q3249424
DOI: 10.1006/AAMA.2001.0791
description: scientific article; zbMATH DE number 1800217