Bicircular signed-graphic matroids
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.