1. A greedy algorithm for finding a large 2‐matching on a random cubic graph. Issue 3 (27th November 2017) Authors: Bal, Deepak; Bennett, Patrick; Bohman, Tom; Frieze, Alan Journal: Journal of graph theory Issue: Volume 88:Issue 3(2018) Page Start: 449 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A Ramsey property of random regular and k‐out graphs. Issue 3 (5th August 2019) Authors: Anastos, Michael; Bal, Deepak Journal: Journal of graph theory Issue: Volume 93:Issue 3(2020) Page Start: 363 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Hamiltonian Berge cycles in random hypergraphs. (8th March 2021) Authors: Bal, Deepak; Berkowitz, Ross; Devlin, Pat; Schacht, Mathias Journal: Combinatorics, probability and computing Issue: Volume 30:Number 2(2021) Page Start: 228 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Rainbow Arborescence in Random Digraphs. Issue 3 (7th October 2015) Authors: Bal, Deepak; Bennett, Patrick; Cooper, Colin; Frieze, Alan; Prałat, Paweł Journal: Journal of graph theory Issue: Volume 83:Issue 3(2016) Page Start: 251 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Rainbow matchings and Hamilton cycles in random graphs1. Issue 3 (6th July 2015) Authors: Bal, Deepak; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 48:Issue 3(2016) Page Start: 503 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Rainbow perfect matchings and Hamilton cycles in the random geometric graph1. Issue 4 (5th April 2017) Authors: Bal, Deepak; Bennett, Patrick; Pérez‐Giménez, Xavier; Prałat, Paweł Journal: Random structures & algorithms Issue: Volume 51:Issue 4(2017) Page Start: 587 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗