Anna de Mier

According to our database1, Anna de Mier authored at least 29 papers between 2001 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
On graphs with the same restricted <i>U</i>-polynomial and the <i>U</i>-polynomial for rooted graphs.
Electron. Notes Discret. Math., 2018

2017
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem.
Discret. Math., 2017

2016
Preface.
Electron. Notes Discret. Math., 2016

2015
Lower bounds on the maximum number of non-crossing acyclic graphs.
Eur. J. Comb., 2015

Extensions and presentations of transversal matroids.
Eur. J. Comb., 2015

An involution on bicubic maps and β(0, 1)-trees.
Australas. J Comb., 2015

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

On the number of self-dual rooted maps.
Eur. J. Comb., 2014

Extremal statistics on non-crossing configurations.
Discret. Math., 2014

2013
Catalan lattice paths with rook, bishop and spider steps.
J. Comb. Theory, Ser. A, 2013

2011
The Tutte polynomial characterizes simple outerplanar graphs.
Electron. Notes Discret. Math., 2011

Characterizations of Transversal and Fundamental Transversal Matroids.
Electron. J. Comb., 2011

Spanning trees of 3-uniform hypergraphs.
Adv. Appl. Math., 2011

2009
On the maximum number of cycles in outerplanar and series-parallel graphs.
Electron. Notes Discret. Math., 2009

2007
A Natural Family of Flag Matroids.
SIAM J. Discret. Math., 2007

k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams.
Electron. Notes Discret. Math., 2007

Lattice paths with periodic boundaries.
Electron. Notes Discret. Math., 2007

<i>k</i> -noncrossing and <i>k</i> -nonnesting graphs and fillings of ferrers diagrams.
Comb., 2007

2006
Lattice path matroids: Structural properties.
Eur. J. Comb., 2006

On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs.
Electron. J. Comb., 2006

2005
A solution to the tennis ball problem.
Theor. Comput. Sci., 2005

On matroids determined by their Tutte polynomials.
Discret. Math., 2005

Tutte uniqueness of line graphs.
Discret. Math., 2005

2004
On Graphs Determined by Their Tutte Polynomials.
Graphs Comb., 2004

Tutte polynomials of generalized parallel connections.
Adv. Appl. Math., 2004

T-uniqueness of some families of <i>k</i>-chordal matroids.
Adv. Appl. Math., 2004

2003
Lattice path matroids: enumerative aspects and Tutte polynomials.
J. Comb. Theory, Ser. A, 2003

Locally grid graphs: classification and Tutte uniqueness.
Discret. Math., 2003

2001
Irreducibility of the Tutte Polynomial of a Connected Matroid.
J. Comb. Theory, Ser. B, 2001


  Loading...