Graphical representations of graphic frame matroids
From MaRDI portal
Abstract: A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, if there is one such graph, there will be many. Zaslavsky has shown that frame matroids are precisely those having a representation as a biased graph; this class includes graphic matroids, bicircular matroids, and Dowling geometries. Whitney characterized which graphs have isomorphic cycle matroids, and Matthews characterised which graphs have isomorphic graphic bicircular matroids. In this paper, we give a characterization of which biased graphs give rise to isomorphic graphic frame matroids.
Recommendations
Cites work
- A class of geometric lattices based on finite groups
- BICIRCULAR MATROIDS
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Characterizations of signed graphs
- Frame matroids and biased graphs
- Projective-planar signed graphs and tangled signed graphs
- Some open problems on excluding a uniform matroid
- The biased graphs whose matroids are binary
Cited in
(12)- The signed-graphic representations of wheels and whirls
- Almost balanced biased graph representations of frame matroids
- Describing quasi-graphic matroids
- A short proof of Shih's isomorphism theorem on graphic subspaces
- scientific article; zbMATH DE number 3995706 (Why is no real title available?)
- On excluded minors of connectivity 2 for the class of frame matroids
- Representations of bicircular lift matroids
- Circuit covers of signed Eulerian graphs
- Connectivity in frame matroids
- Matrix representations of frame and lifted-graphic matroids correspond to gain functions
- The 9-connected excluded minors for the class of quasi-graphic matroids
- Frame matroids and biased graphs
This page was built for publication: Graphical representations of graphic frame matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897266)