111. Coloring random graphs online without creating monochromatic subgraphs1. Issue 4 (17th July 2012) Authors: Mütze, Torsten; Rast, Thomas; Spöhel, Reto Journal: Random structures & algorithms Issue: Volume 44:Issue 4(2014) Page Start: 419 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
112. Coloring random graphs online without creating monochromatic subgraphs1. Issue 4 (17th July 2012) Authors: Mütze, Torsten; Rast, Thomas; Spöhel, Reto Journal: Random structures & algorithms Issue: Volume 44:Issue 4(2014) Page Start: 419 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
113. Coloring triangle‐free graphs with local list sizes. Issue 3 (13th July 2020) Authors: Davies, Ewan; de Joannis de Verclos, Rémi; Kang, Ross J.; Pirot, François Journal: Random structures & algorithms Issue: Volume 57:Issue 3(2020) Page Start: 730 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
114. Colorings, transversals, and local sparsity. Issue 1 (13th October 2021) Authors: Kang, Ross J.; Kelly, Tom Journal: Random structures & algorithms Issue: Volume 61:Issue 1(2022) Page Start: 173 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
115. Color‐biased Hamilton cycles in random graphs. Issue 3 (21st August 2021) Authors: Gishboliner, Lior; Krivelevich, Michael; Michaeli, Peleg Journal: Random structures & algorithms Issue: Volume 60:Issue 3(2022) Page Start: 289 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
116. Combinatorial and stochastic properties of ranked tree‐child networks. Issue 4 (20th September 2021) Authors: Bienvenu, François; Lambert, Amaury; Steel, Mike Journal: Random structures & algorithms Issue: Volume 60:Issue 4(2022) Page Start: 653 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
117. Community detection in the sparse hypergraph stochastic block model. Issue 3 (14th March 2021) Authors: Pal, Soumik; Zhu, Yizhe Journal: Random structures & algorithms Issue: Volume 59:Issue 3(2021) Page Start: 407 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
118. Community modulated recursive trees and population dependent branching processes. Issue 2 (21st June 2021) Authors: Bhamidi, Shankar; Fan, Ruituo; Fraiman, Nicolas; Nobel, Andrew Journal: Random structures & algorithms Issue: Volume 60:Issue 2(2022) Page Start: 201 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
119. Compaction for two models of logarithmic‐depth trees: Analysis and experiments. Issue 1 (13th November 2021) Authors: Bodini, Olivier; Genitrini, Antoine; Gittenberger, Bernhard; Larcher, Isabella; Naima, Mehdi Journal: Random structures & algorithms Issue: Volume 61:Issue 1(2022) Page Start: 31 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
120. Comparison of Swendsen‐Wang and heat‐bath dynamics1. Issue 4 (11th May 2012) Authors: Ullrich, Mario Journal: Random structures & algorithms Issue: Volume 42:Issue 4(2013) Page Start: 520 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗