Almost-graphic matroids (Q696817)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost-graphic matroids |
scientific article |
Statements
Almost-graphic matroids (English)
0 references
12 September 2002
0 references
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.
0 references
almost graphic matroid
0 references
regular matroid
0 references
binary matroid
0 references
planar graph
0 references
