In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B 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. Wikipedia