Graphical representations of graphic frame matroids

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