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 1
Mixing Times and Moving Targets
-
- Published online by Cambridge University Press:
- 14 November 2013, pp. 460-476
-
- Article
- Export citation
- Cited by 1
Maximal chordal subgraphs
- Part of:
-
- Published online by Cambridge University Press:
- 02 May 2023, pp. 724-741
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
The distance profile of rooted and unrooted simply generated trees
- Part of:
-
- Published online by Cambridge University Press:
- 18 August 2021, pp. 368-410
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
The Generic Chaining: Upper and Lower Bounds of Stochastic Processes, by Michel Talagrand , Springer-Verlag, 2005, 222 pp., £ 61.50/$99.00/79.95 Euros.
-
- Published online by Cambridge University Press:
- 01 July 2007, pp. 659-660
-
- Article
- Export citation
- Cited by 1
On a Conjecture by Eriksson Concerning Overlap in Strings
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 429-440
-
- Article
- Export citation
- Cited by 1
Polynomials over structured grids
- Part of:
-
- Published online by Cambridge University Press:
- 04 October 2022, pp. 284-298
-
- Article
- Export citation
- Cited by 1
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
- Part of:
-
- Published online by Cambridge University Press:
- 07 September 2022, pp. 158-182
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
On Intersecting Properties of Partitions of Integers
-
- Published online by Cambridge University Press:
- 11 April 2005, pp. 319-323
-
- Article
- Export citation
- Cited by 1
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Part of:
-
- Published online by Cambridge University Press:
- 15 December 2021, pp. 765-811
-
- Article
- Export citation
- Cited by 1
Constructive Packings by Linear Hypergraphs
-
- Published online by Cambridge University Press:
- 12 September 2013, pp. 829-858
-
- Article
- Export citation
- Cited by 1
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
- Part of:
-
- Published online by Cambridge University Press:
- 08 March 2016, pp. 791-796
-
- Article
- Export citation
- Cited by 1
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
-
- Published online by Cambridge University Press:
- 01 September 2007, pp. 713-732
-
- Article
- Export citation
- Cited by 1
Properties of Classes of Random Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 435-454
-
- Article
- Export citation
- Cited by 1
From GEM back to Dirichlet via Hoppe's Urn
-
- Published online by Cambridge University Press:
- 01 June 1997, pp. 185-195
-
- Article
- Export citation
- Cited by 1
Revolutionaries and Spies on Random Graphs
-
- Published online by Cambridge University Press:
- 08 March 2013, pp. 417-432
-
- Article
- Export citation
- Cited by 1
On Statistics of Permutations Chosen From the Ewens Distribution
-
- Published online by Cambridge University Press:
- 22 August 2014, pp. 889-913
-
- Article
- Export citation
- Cited by 1
Cliques in Graphs With Bounded Minimum Degree
-
- Published online by Cambridge University Press:
- 26 January 2012, pp. 457-482
-
- Article
- Export citation
- Cited by 1
Packing Hamilton Cycles Online
- Part of:
-
- Published online by Cambridge University Press:
- 22 March 2018, pp. 475-495
-
- Article
- Export citation
- Cited by 1
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs
-
- Published online by Cambridge University Press:
- 21 April 2010, pp. 579-591
-
- Article
- Export citation
- Cited by 1
One More Probabilistic Reformulation of the Four Colour Conjecture
-
- Published online by Cambridge University Press:
- 24 August 2010, pp. 829-834
-
- Article
- Export citation