Graphs for n-circular matroids
Renata Kawa · Discussiones Mathematicae Graph Theory · 2010
We give "if and only if " characterization of graphs with the fol-lowing property: given n 3, edges of such graphs form matroids with circuits from the collection of all graphs with n fundamental cy-cles. In this way we refer to the notion of matroidal family dened by Sim~oes-Pereira [2].