Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 3
On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices
-
- Published online by Cambridge University Press:
- 04 February 2014, pp. 449-459
-
- Article
- Export citation
- Cited by 3
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 81-95
-
- Article
- Export citation
- Cited by 3
On Oriented Embedding of the Binary Tree into the Hypercube
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 27-38
-
- Article
- Export citation
- Cited by 3
K5-Subdivisions in Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 179-189
-
- Article
- Export citation
- Cited by 3
On Komlós’ tiling theorem in random graphs
- Part of:
-
- Published online by Cambridge University Press:
- 25 July 2019, pp. 113-127
-
- Article
- Export citation
- Cited by 3
Sampling biased monotonic surfaces using exponential metrics
-
- Published online by Cambridge University Press:
- 30 June 2020, pp. 672-697
-
- Article
- Export citation
- Cited by 3
Subgraphs of Random k-Edge-Coloured k-Regular Graphs
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 533-549
-
- Article
- Export citation
- Cited by 3
On the Strong Chromatic Number of Random Graphs
-
- Published online by Cambridge University Press:
- 01 March 2008, pp. 271-286
-
- Article
- Export citation
- Cited by 3
Optimally Reliable Graphs for Both Vertex and Edge Failures
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 93-100
-
- Article
- Export citation
- Cited by 3
On Lipschitz Bijections Between Boolean Functions
- Part of:
-
- Published online by Cambridge University Press:
- 19 December 2017, pp. 411-426
-
- Article
- Export citation
- Cited by 3
Clustered colouring of graph classes with bounded treedepth or pathwidth
- Part of:
-
- Published online by Cambridge University Press:
- 05 July 2022, pp. 122-133
-
- Article
- Export citation
- Cited by 3
Minimax functions on Galton–Watson trees
- Part of:
-
- Published online by Cambridge University Press:
- 06 December 2019, pp. 455-484
-
- Article
- Export citation
- Cited by 3
The power of two choices for random walks
- Part of:
-
- Published online by Cambridge University Press:
- 28 May 2021, pp. 73-100
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
Clique Partitions of Chordal Graphs†
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 409-415
-
- Article
- Export citation
- Cited by 3
Estimating parameters associated with monotone properties
- Part of:
-
- Published online by Cambridge University Press:
- 24 March 2020, pp. 616-632
-
- Article
- Export citation
- Cited by 3
Poset Ramsey numbers: large Boolean lattice versus a fixed poset
- Part of:
-
- Published online by Cambridge University Press:
- 17 February 2023, pp. 638-653
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 3
An Inequality for Functions on the Hamming Cube
- Part of:
-
- Published online by Cambridge University Press:
- 29 March 2017, pp. 468-480
-
- Article
- Export citation
- Cited by 3
Monochromatic cycle partitions in random graphs
- Part of:
-
- Published online by Cambridge University Press:
- 14 August 2020, pp. 136-152
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
-
- Published online by Cambridge University Press:
- 18 October 2013, pp. 102-115
-
- Article
- Export citation
- Cited by 3
Counting Connected Hypergraphs via the Probabilistic Method
-
- Published online by Cambridge University Press:
- 04 January 2016, pp. 21-75
-
- Article
- Export citation