Quasi-graphic matroids
Authors:
- Jim GeelenJGJim Geelen
- Bert GerardsBGBert Gerards
- Geoff WhittleGWGeoff Whittle
Preprint
Abstract
Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, {\em quasi-graphic matroids}, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids, it is easy to certify that a matroid is quasi-graphic. The main result of the paper is that every $3$-connected representable quasi-graphic matroid is either a lifted-graphic matroid or a frame matroid.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- On Recognizing Frame and Lifted‐Graphic MatroidsJournal of Graph Theory, 2017
- Supersolvable Frame-matroid and Graphic-lift LatticesEuropean Journal of Combinatorics, 2001
- Frame Matroids and Biased GraphsEuropean Journal of Combinatorics, 1994
- Biased graphs. II. The three matroidsJournal of Combinatorial Theory, Series B, 1991
- Recognizing graphic matroidsCombinatorica, 1981