Abstract
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph , the circuits of its bicircular lift matroid are the edge sets of those subgraphs of that contain at least two cycles, and are minimal with respect to this property. For each cycle of , since 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.