The excluded minors for the class of matroids that are graphic or bicircular lift

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph G  , the circuits of its bicircular lift matroid L(G)L(G) are the edge sets of those subgraphs of G that contain at least two cycles, and are minimal with respect to this property. For each cycle C of G  , since L(G)/CL(G)/C is graphic and most graphic matroids are not bicircular lift, the class of bicircular lift matroids is not minor-closed. In this paper, we prove that the class of matroids that are graphic or bicircular lift has a finite list of excluded minors.