Manoel Lemos

Discret. Math., December, 2023

An Upper Bound for the Circumference of a 3-Connected Binary Matroid.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

A matroid operation that commutes with duality.

[BibT_eX]

[DOI]

Discret. Math., 2022

2020

Matroids with a unique non-common circuit containing a fixed element.

[BibT_eX]

[DOI]

Discret. Math., 2020

2018

Improving a chain theorem for triangle-free 3-connected matroids.

[BibT_eX]

[DOI]

Antonio José Ferreira Gomes Jr.

Eur. J. Comb., 2018

2016

The number of elements belonging to triads in 3-connected binary matroids.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

On chains of matroids in the weak order.

[BibT_eX]

[DOI]

Maria Isabelle Silva

Eur. J. Comb., 2015

2014

A Decomposition Theorem for Binary Matroids with no Prism Minor.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

On triangle-free 3-connected matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

2012

Matroids with at least two regular elements.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

On matroids with few circuits containing a pair of elements.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

On the circuit-spectrum of binary matroids.

[BibT_eX]

[DOI]

Talmage James Reid

Haidong Wu

Eur. J. Comb., 2011

Obstructions to a binary matroid being graphic.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

2010

Characterizing 3-connected planar graphs and graphic matroids.

[BibT_eX]

[DOI]

Talmage James Reid

Haidong Wu

J. Graph Theory, 2010

The 3-connected matroids with circumference 6.

[BibT_eX]

[DOI]

Raul Cordovil

Discret. Math., 2010

2009

The 3-connected binary matroids with circumference 6 or 7.

[BibT_eX]

[DOI]

Raul Cordovil

Braulio Maia Jr.

Eur. J. Comb., 2009

Removing circuits in 3-connected binary matroids.

[BibT_eX]

[DOI]

Raul Cordovil

Braulio Maia Jr.

Discret. Math., 2009

A characterization of graphic matroids using non-separating cocircuits.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

Relations between the Circumference and <i>e</i> -Circumference of a Matroid.

[BibT_eX]

[DOI]

Graphs Comb., 2008

2007

On the number of triangles in 3-connected matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

Matroid packing and covering with circuits through an element.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2006

Weight Distribution of the Bases of a Matroid.

[BibT_eX]

[DOI]

Graphs Comb., 2006

On the Circuit-cocircuit Intersection Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Elements belonging to triangles in 3-connected matroids.

[BibT_eX]

[DOI]

Discret. Math., 2006

Matroids with few non-common bases.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Non-separating cocircuits in matroids.

[BibT_eX]

[DOI]

T. R. B. Melo

Electron. Notes Discret. Math., 2005

2004

On the minor-minimal 2-connected graphs having a fixed minor.

[BibT_eX]

[DOI]

Discret. Math., 2004

Elements belonging to triads in 3-connected matroids.

[BibT_eX]

[DOI]

Discret. Math., 2004

On the number of non-isomorphic matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

On removable cycles through every edge.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

On the minor-minimal 3-connected matroids having a fixed minor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Matroids with many common bases.

[BibT_eX]

[DOI]

Discret. Math., 2003

Uniqueness of the decomposition of the rank function of a 2-polymatroid.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

On the Connectivity Function of a Binary Matroid.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

Almost-Graphic Matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

2001

On Mills's conjecture on matroids with many common bases.

[BibT_eX]

[DOI]

Discret. Math., 2001

Matroids Having Small Circumference.

[BibT_eX]

[DOI]

Braulio Maia Jr.

Comb. Probab. Comput., 2001

2000

On the 3-Connected Matroids That are Minimal Having a Fixed Restriction.

[BibT_eX]

[DOI]

Talmage James Reid

Graphs Comb., 2000

On the 3-connected matroids that are minimal having a fixed spanning restriction.

[BibT_eX]

[DOI]

Discret. Math., 2000

On size, circumference and circuit removal in 3-connected matroids.

[BibT_eX]

[DOI]

Discret. Math., 2000

The reconstruction of a matroid from its connectivity function.

[BibT_eX]

[DOI]

Sérgio Mota

Discret. Math., 2000

1999

On removable circuits in graphs and matroids.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

On packing minors into connected matroids.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Non-binary matroids having four non-binary elements.

[BibT_eX]

Ars Comb., 1997

1994

Matroids having the same connectivity function.

[BibT_eX]

[DOI]

Discret. Math., 1994

Non-Binary Madroids Having At Most Three Non-Binary Elements.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

1991

<i>K</i>-Elimination property for circuits of matroids.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

1989

On 3-connected matroids.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

An extension of Lindström's result about characteristic sets of matroids.

[BibT_eX]

[DOI]