|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | N. Inayah, Anna S. Lladó, Jordi Moragas |
Magic and antimagic H-decompositions.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó, Jordi Moragas |
On the modular sumset partition problem. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó |
Almost every tree with n edges decomposes K2n, 2n. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, S. C. López |
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó, S. C. López, Jordi Moragas |
Every tree is a large subtree of a tree that decomposes Kn or Kn, n. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó, Jordi Moragas |
On the Sumset Partition Problem. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Cámara, Anna S. Lladó, Jordi Moragas |
On a conjecture of Graham and Häggkvist with the polynomial method. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
On complete subsets of the cyclic group. |
J. Comb. Theory, Ser. A |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Cámara, Anna S. Lladó, Jordi Moragas |
On a Häggkvist's Conjecture with the Polynomial Method. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó, Jordi Moragas |
Cycle-magic graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó |
Largest cliques in connected supermagic graphs. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna S. Lladó, S. C. López |
Edge-decompositions of Kn, n into isomorphic copies of a given tree. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna M. Lladó Sanchez, Susana Clara López Masip |
Minimum degree and minimum number of edge-disjoint trees. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
Covering a Finite Abelian Group by Subset Sums. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 11A75, 20K01 |
| 1 | A. Gutiérrez, Anna S. Lladó |
Regular packings of regular graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Gutiérrez, Anna S. Lladó |
On the edge-residual number and the line completion number of a graph. |
Ars Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | A. Gutiérrez, Anna S. Lladó, S. C. López |
Higher edge-connectivities and tree decompositions in regular graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
On Restricted Sums. |
Combinatorics, Probability & Computing |
2000 |
DBLP BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell |
On Isoperimetric Connectivity in Vertex-Transitive Graphs. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
On Sets With A Small Subset Sum. |
Combinatorics, Probability & Computing |
1999 |
DBLP BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
An Isoperimetric Problem in Cayley Graphs. |
Theory Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
On Subsets with Small Product in Torsion-Free Groups. |
Combinatorica |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 20D60, 11B75 |
| 1 | Gerhard Ringel, Anna S. Lladó, Oriol Serra |
On the tree number of regular graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
Small cutsets in quasiminimal Cayley graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
Minimum order of loop networks of given degree and girth. |
Graphs and Combinatorics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Angel Fiol, Anna S. Lladó |
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. |
IEEE Trans. Computers |
1992 |
DBLP DOI BibTeX RDF |
partial line digraph technique, large interconnection networks, maximum out-degree, Kautz digraphs, distributed systems, design, routing, connectivity, multiprocessor interconnection networks, directed graphs, expandability |
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
The Connectivity of Hierarchical Cayley Digraphs. |
Discrete Applied Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra |
Vosperian and superconnected Abelian Cayley digraphs. |
Graphs and Combinatorics |
1991 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")