Graphical representations of graphic frame matroids

From MaRDI portal
Publication:897266

DOI10.1007/S00373-014-1497-YzbMATH Open1327.05143arXiv1403.7733OpenAlexW2012753180MaRDI QIDQ897266FDOQ897266


Authors: Rong Chen, Matt DeVos, Daryl Funk, Irene Pivotto Edit this on Wikidata


Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1403.7733




Recommendations




Cites Work


Cited In (12)





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)