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 9
Extremal Graph Problems for Graphs with a Color-Critical Vertex
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 465-477
-
- Article
- Export citation
- Cited by 9
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
-
- Published online by Cambridge University Press:
- 28 April 2004, pp. 389-411
-
- Article
- Export citation
- Cited by 9
Randomized Algorithms for Determining the Majority on Graphs
-
- Published online by Cambridge University Press:
- 14 August 2006, pp. 823-834
-
- Article
- Export citation
- Cited by 9
On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 193-208
-
- Article
- Export citation
- Cited by 9
The Number of Satisfying Assignments of Random Regular k-SAT Formulas
-
- Published online by Cambridge University Press:
- 20 June 2018, pp. 496-530
-
- Article
- Export citation
- Cited by 9
On Universal Threshold Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 327-344
-
- Article
- Export citation
- Cited by 9
The Homomorphism Structure of Classes of Graphs
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 177-184
-
- Article
- Export citation
- Cited by 9
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?
-
- Published online by Cambridge University Press:
- 01 September 2009, pp. 691-705
-
- Article
- Export citation
- Cited by 9
A Remark on the Number of Complete and Empty Subgraphs
-
- Published online by Cambridge University Press:
- 01 June 1998, pp. 217-219
-
- Article
- Export citation
- Cited by 9
Parametrized Tutte Polynomials of Graphs and Matroids
-
- Published online by Cambridge University Press:
- 10 August 2006, pp. 835-854
-
- Article
- Export citation
- Cited by 9
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
-
- Published online by Cambridge University Press:
- 20 April 2012, pp. 611-622
-
- Article
- Export citation
- Cited by 9
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
-
- Published online by Cambridge University Press:
- 02 July 2010, pp. 27-51
-
- Article
- Export citation
- Cited by 9
Balls-in-Bins Processes with Feedback and Brownian Motion
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 87-110
-
- Article
- Export citation
- Cited by 9
Duality in Polymatroids and Set Functions
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 275-280
-
- Article
- Export citation
- Cited by 9
Lower Bounds for Insertion Methods for TSP
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 285-292
-
- Article
- Export citation
- Cited by 9
Planting Colourings Silently
- Part of:
-
- Published online by Cambridge University Press:
- 07 December 2016, pp. 338-366
-
- Article
- Export citation
- Cited by 9
Avoiding Arrays of Odd Order by Latin Squares
-
- Published online by Cambridge University Press:
- 21 December 2012, pp. 184-212
-
- Article
- Export citation
- Cited by 8
Distance Hereditary Graphs and the Interlace Polynomial
-
- Published online by Cambridge University Press:
- 01 November 2007, pp. 947-973
-
- Article
- Export citation
- Cited by 8
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
-
- Published online by Cambridge University Press:
- 01 May 2007, pp. 409-416
-
- Article
- Export citation
- Cited by 8
On the Number of Bh-Sets
- Part of:
-
- Published online by Cambridge University Press:
- 16 September 2015, pp. 108-129
-
- Article
- Export citation