1. Asymptotic enumeration of sparse 2‐connected graphs. Issue 3 (4th April 2012) Authors: Kemkes, Graeme; Sato, Cristiane M.; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 354 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Asymptotic enumeration of strongly connected digraphs by vertices and edges1. Issue 1 (26th April 2012) Authors: Pérez‐Giménez, Xavier; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 80 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Fast uniform generation of random graphs with given degree sequences. Issue 3 (15th March 2021) Authors: Arman, Andrii; Gao, Pu; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 59:Issue 3(2021) Page Start: 291 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Meyniel's conjecture holds for random d‐regular graphs. Issue 3 (7th July 2019) Authors: Prałat, Paweł; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 55:Issue 3(2019) Page Start: 719 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Meyniel's conjecture holds for random graphs1. Issue 2 (31st March 2015) Authors: Prałat, Paweł; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 396 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. The mixing time of the giant component of a random graph1. Issue 3 (14th May 2014) Authors: Benjamini, Itai; Kozma, Gady; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 383 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. The threshold for combs in random graphs1. Issue 4 (9th October 2015) Authors: Kahn, Jeff; Lubetzky, Eyal; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 48:Issue 4(2016) Page Start: 794 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗