1 citations · 1 across the 4 of their papers we have counts for
5 papers
Distance-constrained labellings of Cartesian products of graphs
Anna Lladó, Hamid Mokhtar, Oriol Serra +1
An -labelling of a graph is a mapping such that for and each pair of vertices of at…
On star-forest ascending subgraph decomposition
Anna Lladó, Josep Maria Aroca
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph with edges admits an edge decomposition such that…
Decomposing almost complete graphs by random trees
Anna Lladó
An old conjecture of Ringel states that every tree with edges decomposes the complete graph . The best known lower bound for the order of a complete graph which admit…
On vosperian and superconnected vertex-transitive digraphs
Y. O. Hamidoune, A. Lladó, S. C. López
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some ve…
On complete subsets of the cyclic group
Y. O. Hamidoune, A. S. Lladó, O. Serra
A subset of an abelian is said to be {\em complete} if every element of the subgroup generated by can be expressed as a nonempty sum of distinct elements from . Let…