1. Bal, D., Bennett, P., Cooper, C., Frieze, A., Prałat, P., 2016. Rainbow arborescence in random digraphs. Journal of Graph Theory 83, 251–265. URL: https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.21995, doi: 10.1002/jgt.21995, arXiv: https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.21995.
2. On the edge arboricity of a random graph;Catlin;Ars Combinatoria,1993
3. Chen, X., Li, X., Lian, H., 2013. Note on packing of edge-disjoint spanning trees in sparse random graphs. available as arXiv:1301.1097.
4. On the evolution of random graphs;Erdős;Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960
5. Covering branchings;Frank;Acta Sci. Math. (Szeged),1979