Graphs for n-circular matroids

We give ”if and only if” characterization of graphs with the following property: given n > 3, edges of such graphs form matroids with circuits from the collection of all graphs with n fundamental cycles. In this way we refer to the notion of matroidal family defined by Simoes-Pereira [2]