The following pages link to Anna S. Lladó (Q1356781):
Displaying 46 items.
- On the ascending subgraph decomposition problem for bipartite graphs (Q283657) (← links)
- On the modular sumset partition problem (Q412228) (← links)
- On star forest ascending subgraph decomposition (Q510324) (← links)
- Approximate results for rainbow labelings (Q524169) (← links)
- Magic and antimagic \(H\)-decompositions (Q764906) (← links)
- On complete subsets of the cyclic group (Q958736) (← links)
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- On a conjecture of Graham and Häggkvist with the polynomial method (Q1039430) (← links)
- Small cutsets in quasiminimal Cayley graphs (Q1126189) (← links)
- (Q1175560) (redirect page) (← links)
- Vosperian and superconnected abelian Cayley digraphs (Q1175561) (← links)
- The connectivity of hierarchical Cayley digraphs (Q1199430) (← links)
- On subsets with small product in torsion-free groups (Q1307444) (← links)
- On the tree number of regular graphs (Q1356782) (← links)
- Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
- An isoperimetric problem in Cayley graphs (Q1818087) (← links)
- Covering a finite abelian group by subset sums (Q1882116) (← links)
- Minimum order of loop networks of given degree and girth (Q1895819) (← links)
- On vosperian and superconnected vertex-transitive digraphs (Q1950411) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Largest cliques in connected supermagic graphs (Q2461778) (← links)
- Cycle-magic graphs (Q2462363) (← links)
- On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity (Q2509724) (← links)
- On Restricted Sums (Q2711616) (← links)
- On the Sumset Partition Problem (Q2851432) (← links)
- (Q2857407) (← links)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors (Q3005114) (← links)
- Edge-decompositions of<i>K<sub>n,n</sub></i>into isomorphic copies of a given tree (Q3159387) (← links)
- (Q3433938) (← links)
- On a Häggkvist's Conjecture with the Polynomial Method (Q3503519) (← links)
- (Q3576692) (← links)
- (Q3625875) (← links)
- (Q3791171) (← links)
- (Q3984532) (← links)
- (Q4236613) (← links)
- (Q4505234) (← links)
- (Q4659585) (← links)
- (Q4717035) (← links)
- On Sets with a Small Subset Sum (Q4934784) (← links)
- On Isoperimetric Connectivity in Vertex-Transitive Graphs (Q4943708) (← links)
- The partial line digraph technique in the design of large interconnection networks (Q5375351) (← links)
- Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i><sub>2<i>m</i>,2<i>m</i></sub> (Q5414145) (← links)
- (Q5420003) (← links)
- (Q5480723) (← links)
- Decomposing almost complete graphs by random trees (Q5890651) (← links)
- Decomposing almost complete graphs by random trees (Q5915750) (← links)