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
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 12 October 2020, pp. 412-443
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
Fast Property Testing and Metrics for Permutations
- Part of:
-
- Published online by Cambridge University Press:
- 24 May 2018, pp. 539-579
-
- Article
- Export citation
- Cited by 2
Complexity of Ising Polynomials
-
- Published online by Cambridge University Press:
- 04 July 2012, pp. 743-772
-
- Article
- Export citation
- Cited by 2
(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 87-95
-
- Article
- Export citation
- Cited by 2
Saturated Subgraphs of the Hypercube
- Part of:
-
- Published online by Cambridge University Press:
- 19 September 2016, pp. 52-67
-
- Article
- Export citation
- Cited by 2
The ‘Burnside Process’ Converges Slowly
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 21-34
-
- Article
- Export citation
- Cited by 2
Sharp concentration of the equitable chromatic number of dense random graphs
- Part of:
-
- Published online by Cambridge University Press:
- 26 November 2019, pp. 213-233
-
- Article
- Export citation
- Cited by 2
‘Forcing a sparse minor’ — CORRIGENDUM
-
- Published online by Cambridge University Press:
- 02 June 2015, p. 323
-
- Article
-
- You have access
- Export citation
- Cited by 2
On the Difference of Expected Lengths of Minimum Spanning Trees
-
- Published online by Cambridge University Press:
- 01 May 2009, pp. 423-434
-
- Article
- Export citation
- Cited by 2
A Selection of Problems and Results in Combinatorics
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 1-6
-
- Article
- Export citation
- Cited by 2
The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox
-
- Published online by Cambridge University Press:
- 01 December 1998, pp. 387-396
-
- Article
- Export citation
- Cited by 2
Strong complete minors in digraphs
- Part of:
-
- Published online by Cambridge University Press:
- 24 September 2021, pp. 489-506
-
- Article
- Export citation
- Cited by 2
The Complexity of Counting Colourings of Subgraphs of the Grid
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 377-383
-
- Article
- Export citation
- Cited by 2
Limit Law of the Length of the Standard Right Factor of a Lyndon Word
-
- Published online by Cambridge University Press:
- 01 May 2007, pp. 417-434
-
- Article
- Export citation
- Cited by 2
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs
- Part of:
-
- Published online by Cambridge University Press:
- 07 October 2021, pp. 574-597
-
- Article
- Export citation
- Cited by 2
Anagram-Free Colourings of Graphs
- Part of:
-
- Published online by Cambridge University Press:
- 08 August 2017, pp. 623-642
-
- Article
- Export citation
- Cited by 2
Two Minor Problems
-
- Published online by Cambridge University Press:
- 28 April 2004, pp. 413-414
-
- Article
- Export citation
- Cited by 2
The Inversion Number and the Major Index are Asymptotically Jointly Normally Distributed on Words
- Part of:
-
- Published online by Cambridge University Press:
- 14 January 2016, pp. 470-483
-
- Article
- Export citation
- Cited by 2
The Number of m-ary Search Trees on n Keys
-
- Published online by Cambridge University Press:
- 01 December 1997, pp. 435-453
-
- Article
- Export citation
- Cited by 2
Degree Conditions for H-Linked Digraphs
-
- Published online by Cambridge University Press:
- 08 August 2013, pp. 684-699
-
- Article
- Export citation