Let $G=(V,E)$ be a graph (loops and multiple edges are permitted). Three following systems of dependent sets in $E$ define matroids:


1) Set $A\subset E$ is dependent if $A$ contains cycle. This is a cycle matroid, maybe the most popular matroid.


2) Set $A\subset E$ is dependent if $A$ contains two different cycles in the same connected component. In other words, independent set is characterized by the property that number of edges in any connected component does not exceed number of vertices.


3) Set $A\subset E$ is dependent if $A$ contains either even cycle or two odd cycles in the same connected component. In other words, rank of a connected subgraph $G\_1=(V\_1,E\_1)$ equals $|V\_1|-1$ if $G\_1$ is bipartite and equals $V\_1$ if $G\_1$ has an odd cycle.


My question is whether these examples may be included in a more large picture, and may I read about those matroids.



Matroids similar to the cycle matroid
The first two examples fall neatly into the class of [$(k,l)$-sparsity matroids](https://en.wikipedia.org/wiki/Dense_graph#Sparse_and_tight_graphs) (see the references in this Wikipedia article and references contained within). The cycle matroid (1) is the (1,1)-sparsity matroid on $G$ and the second matroid you describe is the (1,0)-sparsity matroid.


The third example is an example of a [frame matroid](http://matroidunion.org/?p=161) and has been called the "even-circle matroid". It appears in [a paper of Doob](http://www.sciencedirect.com/science/article/pii/0095895673900300) on the eigenspace of -2 of the adjacency matrix of a graph, and in [Zaslavsky's paper "Biased Graphs I"](http://www.sciencedirect.com/science/article/pii/0095895689900634) (the first in the series linked by Gordon Royle) it appears as example 6.3. (Note that what Zaslavsky calls bias matroids are now called frame matroids).


There are some common generalizations of sparsity matroids and frame matroids, see e.g. [these](http://arxiv.org/abs/1207.3601) [papers](http://arxiv.org/abs/1507.01259) by Tanigawa.


