Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Van Bussel, Frank
2004.
0-Centred and 0-ubiquitously graceful trees.
Discrete Mathematics,
Vol. 277,
Issue. 1-3,
p.
193.
Lladó, Anna
and
López, S.C.
2005.
Edge-decompositions ofKn,ninto isomorphic copies of a given tree.
Journal of Graph Theory,
Vol. 48,
Issue. 1,
p.
1.
Sun, Zhi-Wei
and
Yeh, Yeong-Nan
2005.
On various restricted sumsets.
Journal of Number Theory,
Vol. 114,
Issue. 2,
p.
209.
Shiue, Chin-Lin
and
Fu, Hung-Lin
2006.
α-labeling number of trees.
Discrete Mathematics,
Vol. 306,
Issue. 24,
p.
3290.
Lladó, A.
López, S.C.
and
Moragas, J.
2010.
Every tree is a large subtree of a tree that decomposes Kn or Kn,n.
Discrete Mathematics,
Vol. 310,
Issue. 4,
p.
838.
Lladó, Anna
2011.
Almost every tree with n edges decomposes K2n,2n.
Electronic Notes in Discrete Mathematics,
Vol. 38,
Issue. ,
p.
571.
Lladó, Anna
2014.
Decomposing almost complete graphs by random trees.
Electronic Notes in Discrete Mathematics,
Vol. 46,
Issue. ,
p.
177.
DRMOTA, M.
and
LLADÓ, A.
2014.
Almost Every Tree With m Edges Decomposes K2m,2m.
Combinatorics, Probability and Computing,
Vol. 23,
Issue. 1,
p.
50.
Lladó, Anna
2018.
Decomposing almost complete graphs by random trees.
Journal of Combinatorial Theory, Series A,
Vol. 154,
Issue. ,
p.
406.
Jordon, Heather
and
Mitchell, Lon
2022.
Signed Langford sequences.
Discrete Mathematics,
Vol. 345,
Issue. 3,
p.
112719.