Bicircular matroid
In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle. The bicircular matroid was introduced by and explored further by and others. It is a special case of the frame matroid of a biased graph.
Wikipage redirect
primaryTopic
Bicircular matroid
In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle. The bicircular matroid was introduced by and explored further by and others. It is a special case of the frame matroid of a biased graph.
has abstract
In the mathematical subject of ...... ame matroid of a biased graph.
@en
Wikipage page ID
13,511,620
Wikipage revision ID
702,633,083
subject
hypernym
type
comment
In the mathematical subject of ...... ame matroid of a biased graph.
@en
label
Bicircular matroid
@en