An extension of Lindström's result about characteristic sets of matroids. - Manoel Lemos (Discret. Math., 1988)

On 3-connected matroids. - Manoel Lemos (Discret. Math., 1989)

K-Elimination property for circuits of matroids. - Manoel Lemos (J. Comb. Theory B, 1991)

Non-Binary Madroids Having At Most Three Non-Binary Elements. - Manoel Lemos (Comb. Probab. Comput., 1994)

Matroids having the same connectivity function. - Manoel Lemos (Discret. Math., 1994)

Non-binary matroids having four non-binary elements. - Manoel Lemos (Ars Comb., 1997)

On packing minors into connected matroids. - Manoel Lemos; James G. Oxley (Discret. Math., 1998)

On removable circuits in graphs and matroids. - Manoel Lemos; James G. Oxley (J. Graph Theory, 1999)

The reconstruction of a matroid from its connectivity function. - Manoel Lemos; Sérgio Mota (Discret. Math., 2000)

On size, circumference and circuit removal in 3-connected matroids. - Manoel Lemos; James G. Oxley (Discret. Math., 2000)

On the 3-connected matroids that are minimal having a fixed spanning restriction. - Manoel Lemos; James G. Oxley (Discret. Math., 2000)

On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. - Manoel Lemos; James G. Oxley; Talmage James Reid (Graphs Comb., 2000)

Matroids Having Small Circumference. - Braulio Maia Jr.; Manoel Lemos (Comb. Probab. Comput., 2001)

On Mills's conjecture on matroids with many common bases. - Manoel Lemos (Discret. Math., 2001)

Almost-Graphic Matroids. - Sandra R. Kingan; Manoel Lemos (Adv. Appl. Math., 2002)

On the Connectivity Function of a Binary Matroid. - Manoel Lemos (J. Comb. Theory B, 2002)

Uniqueness of the decomposition of the rank function of a 2-polymatroid. - Manoel Lemos (Discret. Math., 2003)

Matroids with many common bases. - Manoel Lemos (Discret. Math., 2003)

On the minor-minimal 3-connected matroids having a fixed minor. - Manoel Lemos; James G. Oxley (Eur. J. Comb., 2003)

On removable cycles through every edge. - Manoel Lemos; James G. Oxley (J. Graph Theory, 2003)

On the number of non-isomorphic matroids. - Manoel Lemos (Adv. Appl. Math., 2004)

Elements belonging to triads in 3-connected matroids. - Manoel Lemos (Discret. Math., 2004)

On the minor-minimal 2-connected graphs having a fixed minor. - Manoel Lemos; James G. Oxley (Discret. Math., 2004)

Matroids with few non-common bases. - Manoel Lemos (Discret. Math., 2006)

Elements belonging to triangles in 3-connected matroids. - Manoel Lemos (Discret. Math., 2006)

On the Circuit-cocircuit Intersection Conjecture. - Sandra R. Kingan; Manoel Lemos (Graphs Comb., 2006)

Weight Distribution of the Bases of a Matroid. - Manoel Lemos (Graphs Comb., 2006)

Matroid packing and covering with circuits through an element. - Manoel Lemos; James G. Oxley (J. Comb. Theory B, 2006)

On the number of triangles in 3-connected matroids. - Manoel Lemos (Eur. J. Comb., 2007)

Non-separating cocircuits in matroids. - Manoel Lemos; T. R. B. Melo (Discret. Appl. Math., 2008)

Relations between the Circumference and e -Circumference of a Matroid. - Manoel Lemos (Graphs Comb., 2008)

A characterization of graphic matroids using non-separating cocircuits. - Manoel Lemos (Adv. Appl. Math., 2009)

Removing circuits in 3-connected binary matroids. - Raul Cordovil; Braulio Maia Jr.; Manoel Lemos (Discret. Math., 2009)

The 3-connected binary matroids with circumference 6 or 7. - Raul Cordovil; Braulio Maia Jr.; Manoel Lemos (Eur. J. Comb., 2009)

The 3-connected matroids with circumference 6. - Raul Cordovil; Manoel Lemos (Discret. Math., 2010)

Characterizing 3-connected planar graphs and graphic matroids. - Manoel Lemos; Talmage James Reid; Haidong Wu (J. Graph Theory, 2010)

Obstructions to a binary matroid being graphic. - Hong-Jian Lai; Manoel Lemos; Talmage James Reid; Yehong Shao; Haidong Wu (Eur. J. Comb., 2011)

On the circuit-spectrum of binary matroids. - Manoel Lemos; Talmage James Reid; Haidong Wu (Eur. J. Comb., 2011)

On matroids with few circuits containing a pair of elements. - Manoel Lemos (Discret. Math., 2012)

Matroids with at least two regular elements. - Sandra R. Kingan; Manoel Lemos (Eur. J. Comb., 2012)

On triangle-free 3-connected matroids. - Manoel Lemos (Adv. Appl. Math., 2013)

A Decomposition Theorem for Binary Matroids with no Prism Minor. - Sandra R. Kingan; Manoel Lemos (Graphs Comb., 2014)

On chains of matroids in the weak order. - Manoel Lemos; Maria Isabelle Silva (Eur. J. Comb., 2015)

The number of elements belonging to triads in 3-connected binary matroids. - Antonio José Ferreira Gomes Jr.; Manoel Lemos (Discret. Math., 2016)

Improving a chain theorem for triangle-free 3-connected matroids. - Manoel Lemos (Eur. J. Comb., 2018)

Matroids with a unique non-common circuit containing a fixed element. - Manoel Lemos (Discret. Math., 2020)

A matroid operation that commutes with duality. - Manoel Lemos (Discret. Math., 2022)

An Upper Bound for the Circumference of a 3-Connected Binary Matroid. - Manoel Lemos; James G. Oxley (Electron. J. Comb., 2023)

On matroids with the same connectivity function. - Manoel Lemos (Discret. Math., 2023)