Anna S. Lladó

Mirka Miller

Period. Math. Hung., 2017

On Star Forest Ascending Subgraph Decomposition.

[BibT_eX]

[DOI]

Josep M. Aroca

Electron. J. Comb., 2017

2014

Decomposing almost complete graphs by random trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

On the ascending subgraph decomposition problem for bipartite graphs.

[BibT_eX]

[DOI]

Josep M. Aroca

S. Slamin

Electron. Notes Discret. Math., 2014

Almost Every Tree With m Edges Decomposes K 2m, 2m .

[BibT_eX]

[DOI]

Michael Drmota

Comb. Probab. Comput., 2014

2013

On Vosperian and Superconnected Vertex-Transitive Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

2012

On the modular sumset partition problem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Magic and antimagic H-decompositions.

[BibT_eX]

[DOI]

Nur Inayah

Discret. Math., 2012

2011

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Almost every tree with n edges decomposes K2n, 2n.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Every tree is a large subtree of a tree that decomposes Kn or Kn, n.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

On the Sumset Partition Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On a conjecture of Graham and Häggkvist with the polynomial method.

[BibT_eX]

[DOI]

Marc Cámara

Eur. J. Comb., 2009

2008

On complete subsets of the cyclic group.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2008

2007

On a Häggkvist's Conjecture with the Polynomial Method.

[BibT_eX]

[DOI]

Marc Cámara

Electron. Notes Discret. Math., 2007

Largest cliques in connected supermagic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Cycle-magic graphs.

[BibT_eX]

[DOI]

Francesc A. Muntaner-Batle

Discret. Math., 2007

2006

Any tree is a large subgraph of a magic tree.

[BibT_eX]

[DOI]

Anna Lladó

Australas. J Comb., 2006

2005

Edge-decompositions of Kn, n into isomorphic copies of a given tree.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Minimum tree decompositions with a given tree as a factor.

[BibT_eX]

[DOI]

Anna Lladó

Susana-Clara López Masip

Australas. J Comb., 2005

2004

Minimum degree and minimum number of edge-disjoint trees.

[BibT_eX]

[DOI]

Anna M. Lladó Sanchez

Susana-Clara López Masip

Discret. Math., 2004

2003

Covering a Finite Abelian Group by Subset Sums.

[BibT_eX]

[DOI]

Comb., 2003

2002

Regular packings of regular graphs.

[BibT_eX]

[DOI]

Amauri Gutiérrez

Discret. Math., 2002

On the edge-residual number and the line completion number of a graph.

[BibT_eX]

Amauri Gutiérrez

Ars Comb., 2002

2000

On Isoperimetric Connectivity in Vertex-Transitive Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Higher edge-connectivities and tree decompositions in regular graphs.

[BibT_eX]

[DOI]

Amauri Gutiérrez

Discret. Math., 2000

On Restricted Sums.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

1999

An Isoperimetric Problem in Cayley Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

On Sets With A Small Subset Sum.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

1998

On Subsets with Small Product in Torsion-Free Groups.

[BibT_eX]

[DOI]

Comb., 1998

1997

On the tree number of regular graphs.

[BibT_eX]

[DOI]

Gerhard Ringel

Discret. Math., 1997

1996

Small cutsets in quasiminimal Cayley graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Minimum order of loop networks of given degree and girth.

[BibT_eX]

[DOI]

Graphs Comb., 1995

1992

The Partial Line Digraph Technique in the Design of Large Interconnection Networks.

[BibT_eX]

[DOI]

Miguel Angel Fiol

IEEE Trans. Computers, 1992

The Connectivity of Hierarchical Cayley Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Vosperian and superconnected Abelian Cayley digraphs.

[BibT_eX]

[DOI]