Bicircular signed-graphic matroids
arXiv:1306.6409 · doi:10.1016/j.disc.2014.03.022
Abstract
Several matroids can be defined on the edge set of a graph. Although historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s gives a characterization of graphs whose bicircular matroids are graphic. We give a characterization of graphs whose bicircular matroids are signed-graphic.
arXiv comment8 pages