Anna S. Lladó

Publication Activity (10 Years)

Years Active: 1991-2017
Publications (10 Years): 2

Top Topics

Bipartite Graph

Equivalence Classes

Top Venues

Electron. Notes Discret. Math.

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Josep M. Aroca, Anna S. Lladó
On Star Forest Ascending Subgraph Decomposition. Electron. J. Comb. 24 (1) (2017)
Anna S. Lladó, Mirka Miller
Approximate results for rainbow labelings. Period. Math. Hung. 74 (1) (2017)
Anna S. Lladó
Decomposing almost complete graphs by random trees. Electron. Notes Discret. Math. 46 (2014)
Michael Drmota, Anna S. Lladó
. Comb. Probab. Comput. 23 (1) (2014)
Josep M. Aroca, Anna S. Lladó, S. Slamin
On the ascending subgraph decomposition problem for bipartite graphs. Electron. Notes Discret. Math. 46 (2014)
Anna S. Lladó
On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity. Eur. J. Comb. 34 (8) (2013)
Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López
On Vosperian and Superconnected Vertex-Transitive Digraphs. Graphs Comb. 29 (2) (2013)
Anna S. Lladó, Jordi Moragas
On the modular sumset partition problem. Eur. J. Comb. 33 (4) (2012)
Nur Inayah, Anna S. Lladó, Jordi Moragas
Magic and antimagic H-decompositions. Discret. Math. 312 (7) (2012)
Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67 (2) (2011)
Anna S. Lladó
Almost every tree with n edges decomposes K2n, 2n. Electron. Notes Discret. Math. 38 (2011)
Anna S. Lladó, Susana-Clara López, Jordi Moragas
. Discret. Math. 310 (4) (2010)
Marc Cámara, Anna S. Lladó, Jordi Moragas
On a conjecture of Graham and Häggkvist with the polynomial method. Eur. J. Comb. 30 (7) (2009)
Anna S. Lladó, Jordi Moragas
On the Sumset Partition Problem. Electron. Notes Discret. Math. 34 (2009)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On complete subsets of the cyclic group. J. Comb. Theory, Ser. A 115 (7) (2008)
Anna S. Lladó, Jordi Moragas
Cycle-magic graphs. Discret. Math. 307 (23) (2007)
Marc Cámara, Anna S. Lladó, Jordi Moragas
On a Häggkvist's Conjecture with the Polynomial Method. Electron. Notes Discret. Math. 29 (2007)
Anna S. Lladó
Largest cliques in connected supermagic graphs. Eur. J. Comb. 28 (8) (2007)
Anna S. Lladó, Susana-Clara López
into isomorphic copies of a given tree. J. Graph Theory 48 (1) (2005)
Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Covering a Finite Abelian Group by Subset Sums. Comb. 23 (4) (2003)
A. Gutiérrez, Anna S. Lladó
On the edge-residual number and the line completion number of a graph. Ars Comb. 63 (2002)
A. Gutiérrez, Anna S. Lladó
Regular packings of regular graphs. Discret. Math. 244 (1-3) (2002)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell
On Isoperimetric Connectivity in Vertex-Transitive Graphs. SIAM J. Discret. Math. 13 (1) (2000)
A. Gutiérrez, Anna S. Lladó, Susana-Clara López
Higher edge-connectivities and tree decompositions in regular graphs. Discret. Math. 214 (1-3) (2000)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Restricted Sums. Comb. Probab. Comput. 9 (6) (2000)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
An Isoperimetric Problem in Cayley Graphs. Theory Comput. Syst. 32 (5) (1999)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Sets With A Small Subset Sum. Comb. Probab. Comput. 8 (5) (1999)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Subsets with Small Product in Torsion-Free Groups. Comb. 18 (4) (1998)
Gerhard Ringel, Anna S. Lladó, Oriol Serra
On the tree number of regular graphs. Discret. Math. (1997)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Small cutsets in quasiminimal Cayley graphs. Discret. Math. 159 (1-3) (1996)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Minimum order of loop networks of given degree and girth. Graphs Comb. 11 (2) (1995)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
The Connectivity of Hierarchical Cayley Digraphs. Discret. Appl. Math. (1992)
Miguel Angel Fiol, Anna S. Lladó
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. IEEE Trans. Computers 41 (7) (1992)
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Vosperian and superconnected Abelian Cayley digraphs. Graphs Comb. 7 (2) (1991)