Ferber, A., Kronenberg, G., & Long, E. (2017). Packing, counting and covering Hamilton cycles in random directed graphs. Springer Verlag.
Chicago-čujuhus (17. p.)Ferber, A., G. Kronenberg, juo E. Long. Packing, Counting and Covering Hamilton Cycles in Random Directed Graphs. Springer Verlag, 2017.
MLA-čujuhus (9. p.)Ferber, A., et al. Packing, Counting and Covering Hamilton Cycles in Random Directed Graphs. Springer Verlag, 2017.
Muitte dárkkistit čujuhemiid riektatvuođa, ovdal go geavahat daid iežat deavsttas.