Quasi‐graphic matroids*
Authors:
- 7 September 2017
- journal article
- retracted article
- Published by Wiley in Journal of Graph Theory
- Vol. 87 (2) , 253-264
Abstract
Frame matroids and lifted‐graphic matroids are two interesting generalizations of graphic matroids. Here, we introduce a new generalization, quasi‐graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted‐graphic matroids, it is easy to certify that a 3‐connected matroid is quasi‐graphic. The main result is that every 3‐connected representable quasi‐graphic matroid is either a lifted‐graphic matroid or a frame matroid.Keywords
All Related Versions
Funding Information
- Office of Naval Research (N00014‐10‐1‐0851)
- Natural Sciences and Engineering Research Council of Canada (203110‐2011)
This publication has 5 references indexed in Scilit:
- Matroid Theory2011
- Supersolvable Frame-matroid and Graphic-lift LatticesEuropean Journal of Combinatorics, 2001
- Frame Matroids and Biased GraphsEuropean Journal of Combinatorics, 1994
- Biased graphs. I. Bias, balance, and gainsJournal of Combinatorial Theory, Series B, 1989
- Recognizing graphic matroidsCombinatorica, 1981