Geometric algorithms and combinatorial optimization [Book]
Geometry and combinatorics related to vector partition functions
Graphic Splitting of Cographic Matroids
In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M.
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 Simões-Pereira [2].