Almost-Graphic Matroids

@inproceedings{Kingan2002AlmostGraphicM,
  title={Almost-Graphic Matroids},
  author={Sandra R. Kingan and Manoel Lemos},
  year={2002}
}
A nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/e is graphic. We determine completely the class of almost-graphic matroids, thereby answering a question posed by Oxley in his book “Matroid Theory.” A nonregular matroid is said to be almost-regular if, for all elements e, either M\e or M/e is regular. An element e for which both M\e and M/e are regular is called a regular element. We also determine the almost-regular matroids with at least one regular… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Matroid theory

View 6 Excerpts
Highly Influenced

A characterization of a class of non-binary matroids

J. Comb. Theory, Ser. B • 1990
View 6 Excerpts
Highly Influenced

On the Structure of 3-connected Matroids and Graphs

Eur. J. Comb. • 2000
View 1 Excerpt
Highly Influenced

A Characterization of Almost-Planar Graphs

Combinatorics, Probability & Computing • 1996
View 3 Excerpts
Highly Influenced

Matroids that are almost series-parallel networks, in “Proceedings of the Twenty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 1996,

A. D. Mills
Congressus Numer • 1996
View 1 Excerpt

Decomposition of regular matroids

J. Comb. Theory, Ser. B • 1980

Similar Papers

Loading similar papers…