Source: OpenCitations
Linearly many rainbow trees in properly edge-coloured complete graphs
Journal of Combinatorial Theory Series B
Journal reference : Volume 132, 2018, pp. 134-156
DOI : 10.1016/j.jctb.2018.03.005Decompositions into spanning rainbow structures
arXiv (Cornell University)
Journal reference : Volume 119, 2019, pp. 899-959
DOI : 10.1112/plms.12245Rainbow structures in locally bounded colorings of graphs
Random Structures and Algorithms
Journal reference : Volume 56, 2020, pp. 1171-1204
DOI : 10.1002/rsa.20902Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees
IRIS UNIMORE (University of Modena and Reggio Emilia)
Journal reference : Volume 39, 2023, pp.
DOI : 10.1007/s00373-023-02610-6Edge-disjoint rainbow trees in properly coloured complete graphs
UCL Discovery (University College London)
Journal reference : Volume 61, 2017, pp. 995-1001
DOI : 10.1016/j.endm.2017.07.064Multicolored trees in complete graphs
Journal of Graph Theory
Journal reference : Volume 54, 2006, pp. 221-232
DOI : 10.1002/jgt.20204Decompositions into isomorphic rainbow spanning trees
arXiv (Cornell University)
Journal reference : Volume 146, 2020, pp. 439-484
DOI : 10.1016/j.jctb.2020.03.002Rainbow spanning trees in properly coloured complete graphs
arXiv (Cornell University)
Journal reference : Volume 247, 2018, pp. 97-101
DOI : 10.1016/j.dam.2018.03.066Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
SIAM Journal on Discrete Mathematics
Journal reference : Volume 34, 2020, pp. 2346-2362
DOI : 10.1137/19m1299876Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
IRIS UNIMORE (University of Modena and Reggio Emilia)
Journal reference : Volume 342, 2018, pp. 1006-1016
DOI : 10.1016/j.disc.2018.11.026