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 58
On Brooks' Theorem for Sparse Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 97-132
-
- Article
- Export citation
- Cited by 58
Conflict-Free Colourings of Graphs and Hypergraphs
-
- Published online by Cambridge University Press:
- 01 September 2009, pp. 819-834
-
- Article
- Export citation
- Cited by 58
Sumset and Inverse Sumset Theory for Shannon Entropy
-
- Published online by Cambridge University Press:
- 22 January 2010, pp. 603-639
-
- Article
- Export citation
- Cited by 57
Simulating a Random Walk with Constant Error
-
- Published online by Cambridge University Press:
- 14 August 2006, pp. 815-822
-
- Article
- Export citation
- Cited by 57
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
-
- Published online by Cambridge University Press:
- 28 April 2004, pp. 319-337
-
- Article
- Export citation
- Cited by 56
A Tutte Polynomial for Coloured Graphs
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 45-93
-
- Article
- Export citation
- Cited by 55
A Zero-Free Interval for Chromatic Polynomials of Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 325-336
-
- Article
- Export citation
- Cited by 55
Many Random Walks Are Faster Than One†
-
- Published online by Cambridge University Press:
- 07 April 2011, pp. 481-502
-
- Article
- Export citation
- Cited by 55
Randomized Pursuit-Evasion in Graphs
-
- Published online by Cambridge University Press:
- 20 May 2003, pp. 225-244
-
- Article
- Export citation
- Cited by 54
Regular Partitions of Hypergraphs: Regularity Lemmas
-
- Published online by Cambridge University Press:
- 01 November 2007, pp. 833-885
-
- Article
- Export citation
- Cited by 54
Random Graph Processes with Degree Restrictions
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 169-180
-
- Article
- Export citation
- Cited by 53
The Induced Size-Ramsey Number of Cycles
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 217-239
-
- Article
- Export citation
- Cited by 51
The Zero-Free Intervals for Chromatic Polynomials of Graphs
-
- Published online by Cambridge University Press:
- 01 December 1997, pp. 497-506
-
- Article
- Export citation
- Cited by 51
On Arithmetic Progressions of Cycle Lengths in Graphs
-
- Published online by Cambridge University Press:
- 03 November 2000, pp. 369-373
-
- Article
- Export citation
- Cited by 51
Hypergraphs Do Jump
-
- Published online by Cambridge University Press:
- 13 July 2010, pp. 161-171
-
- Article
- Export citation
- Cited by 51
Triple Systems Not Containing a Fano Configuration
-
- Published online by Cambridge University Press:
- 21 July 2005, pp. 467-484
-
- Article
- Export citation
- Cited by 50
Precoloring Extension III: Classes of Perfect Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 35-56
-
- Article
- Export citation
- Cited by 50
Ramsey Classes and Homogeneous Structures
-
- Published online by Cambridge University Press:
- 15 February 2005, pp. 171-189
-
- Article
- Export citation
- Cited by 50
The Expected Norm of Random Matrices
-
- Published online by Cambridge University Press:
- 01 March 2000, pp. 149-166
-
- Article
-
- You have access
- Export citation
- Cited by 49
Triangle Factors in Random Graphs
-
- Published online by Cambridge University Press:
- 01 September 1997, pp. 337-347
-
- Article
- Export citation