Anna de Mier

Discret. Math., August, 2023

2021

On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial.

[BibT_eX]

[DOI]

José Aliste-Prieto

José Zamora

Discret. Math., 2021

2018

On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs.

[BibT_eX]

[DOI]

José Aliste-Prieto

José Zamora

Electron. Notes Discret. Math., 2018

2017

On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem.

[BibT_eX]

[DOI]

José Aliste-Prieto

José Zamora

Discret. Math., 2017

2016

Preface.

[BibT_eX]

[DOI]

Oriol Serra

Electron. Notes Discret. Math., 2016

2015

Lower bounds on the maximum number of non-crossing acyclic graphs.

[BibT_eX]

[DOI]

Clemens Huemer

Eur. J. Comb., 2015

Extensions and presentations of transversal matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

An involution on bicubic maps and β(0, 1)-trees.

[BibT_eX]

[DOI]

Anders Claesson

Sergey Kitaev

Australas. J Comb., 2015

2014

Enumeration of Fixed Points of an Involution on β(1, 0)-Trees.

[BibT_eX]

[DOI]

Sergey Kitaev

Graphs Comb., 2014

On the number of self-dual rooted maps.

[BibT_eX]

[DOI]

Sergey Kitaev

Eur. J. Comb., 2014

Extremal statistics on non-crossing configurations.

[BibT_eX]

[DOI]

Michael Drmota

Discret. Math., 2014

2013

Catalan lattice paths with rook, bishop and spider steps.

[BibT_eX]

[DOI]

Joseph P. S. Kung

J. Comb. Theory, Ser. A, 2013

2011

The Tutte polynomial characterizes simple outerplanar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Characterizations of Transversal and Fundamental Transversal Matroids.

[BibT_eX]

[DOI]

Joseph P. S. Kung

Electron. J. Comb., 2011

Spanning trees of 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Andrew J. Goodall

Adv. Appl. Math., 2011

2009

On the maximum number of cycles in outerplanar and series-parallel graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2007

A Natural Family of Flag Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Lattice paths with periodic boundaries.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

k -noncrossing and k -nonnesting graphs and fillings of ferrers diagrams.

[BibT_eX]

[DOI]

Comb., 2007

2006

Lattice path matroids: Structural properties.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

A solution to the tennis ball problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On matroids determined by their Tutte polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2005

Tutte uniqueness of line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

On Graphs Determined by Their Tutte Polynomials.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Tutte polynomials of generalized parallel connections.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

T-uniqueness of some families of k-chordal matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Lattice path matroids: enumerative aspects and Tutte polynomials.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2003

Locally grid graphs: classification and Tutte uniqueness.

[BibT_eX]

[DOI]

Alberto Márquez

Maria Pastora Revuelta Marchena

Discret. Math., 2003

2001

Irreducibility of the Tutte Polynomial of a Connected Matroid.

[BibT_eX]

[DOI]

Criel Merino