|
Search the dblp DataBase
Anna S. Lladó:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- A. Gutiérrez, Anna S. Lladó
On the edge-residual number and the line completion number of a graph. [Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:63, n:, pp:- [Journal]
- Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Covering a Finite Abelian Group by Subset Sums. [Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:4, pp:599-611 [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Subsets with Small Product in Torsion-Free Groups. [Citation Graph (0, 0)][DBLP] Combinatorica, 1998, v:18, n:4, pp:529-540 [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Restricted Sums. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Sets With A Small Subset Sum. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
The Connectivity of Hierarchical Cayley Digraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:275-280 [Journal]
- A. Gutiérrez, Anna S. Lladó
Regular packings of regular graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:244, n:1-3, pp:83-94 [Journal]
- A. Gutiérrez, Anna S. Lladó, S. C. López
Higher edge-connectivities and tree decompositions in regular graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:214, n:1-3, pp:245-250 [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
An Isoperimetric Problem in Cayley Graphs. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1999, v:32, n:5, pp:507-516 [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell
On Isoperimetric Connectivity in Vertex-Transitive Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:1, pp:139-144 [Journal]
- Miguel Angel Fiol, Anna S. Lladó
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1992, v:41, n:7, pp:848-857 [Journal]
- Anna S. Lladó, S. C. López
Edge-decompositions of Kn, n into isomorphic copies of a given tree. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:1, pp:1-18 [Journal]
- Gerhard Ringel, Anna S. Lladó, Oriol Serra
On the tree number of regular graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:587-595 [Journal]
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Small cutsets in quasiminimal Cayley graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:159, n:1-3, pp:131-142 [Journal]
Cycle-magic graphs. [Citation Graph (, )][DBLP]
Every tree is a large subtree of a tree that decomposes Kn or Kn, n. [Citation Graph (, )][DBLP]
Largest cliques in connected supermagic graphs. [Citation Graph (, )][DBLP]
On a conjecture of Graham and Häggkvist with the polynomial method. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|