Rainbow Arborescence in Random Digraphs
From MaRDI portal
Publication:2833120
DOI10.1002/jgt.21995zbMath1352.05160DBLPjournals/jgt/BalBCFP16arXiv1411.3364OpenAlexW1871140597WikidataQ57401405 ScholiaQ57401405MaRDI QIDQ2833120
Patrick Bennett, Paweł Prałat, Deepak Bal, Colin Cooper, Alan M. Frieze
Publication date: 16 November 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.3364
Related Items (3)
Packing arborescences in random digraphs ⋮ Packing Arborescences in Random Digraphs ⋮ Hamiltonicity in random directed graphs is born resilient
Cites Work
- Power of \(k\) choices and rainbow spanning trees in random graphs
- Rainbow matchings and Hamilton cycles in random graphs
- On the probable behaviour of some algorithms for finding the stability number of a graph
- Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
- Rainbow Hamilton cycles in random regular graphs
- On a simple formula for random mappings and its applications
- Epidemic process on a random graph: some preliminary results
- Multicolored trees in random graphs
- Rainbow hamilton cycles in random graphs
- Unnamed Item
This page was built for publication: Rainbow Arborescence in Random Digraphs
