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 11
Dominating a Family of Graphs with Small Connected Subgraphs
-
- Published online by Cambridge University Press:
- 03 November 2000, pp. 309-313
-
- Article
- Export citation
- Cited by 11
Eigenvalue Ratios of Non-Negatively Curved Graphs
- Part of:
-
- Published online by Cambridge University Press:
- 23 May 2018, pp. 829-850
-
- Article
- Export citation
- Cited by 11
On the Expected Depth of Random Circuits
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 209-228
-
- Article
- Export citation
- Cited by 11
Compound Poisson Approximation for Dissociated Random Variables via Stein's Method
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 335-346
-
- Article
- Export citation
- Cited by 11
Tuza's Conjecture is Asymptotically Tight for Dense Graphs
- Part of:
-
- Published online by Cambridge University Press:
- 14 March 2016, pp. 645-667
-
- Article
- Export citation
- Cited by 11
Markov Processes Involving q-Stirling Numbers
-
- Published online by Cambridge University Press:
- 01 June 1997, pp. 165-178
-
- Article
- Export citation
- Cited by 11
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 385-395
-
- Article
- Export citation
- Cited by 11
Max Cut for Random Graphs with a Planted Partition
-
- Published online by Cambridge University Press:
- 24 September 2004, pp. 451-474
-
- Article
- Export citation
- Cited by 11
Graph Minors I: A Short Proof of the Path-width Theorem
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 27-30
-
- Article
- Export citation
- Cited by 11
Smallest Sets of Longest Paths with Empty Intersection
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 429-436
-
- Article
- Export citation
- Cited by 11
The Equivalence of Two Graph Polynomials and a Symmetric Function
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 601-615
-
- Article
- Export citation
- Cited by 11
Positive Influence and Negative Dependence
-
- Published online by Cambridge University Press:
- 14 August 2006, pp. 29-41
-
- Article
- Export citation
- Cited by 11
An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
-
- Published online by Cambridge University Press:
- 28 October 2014, pp. 754-773
-
- Article
- Export citation
- Cited by 11
Equitable Colourings of d-degenerate Graphs
-
- Published online by Cambridge University Press:
- 28 January 2003, pp. 53-60
-
- Article
- Export citation
- Cited by 11
On the Size-Ramsey Number of Cycles
- Part of:
-
- Published online by Cambridge University Press:
- 17 July 2019, pp. 871-880
-
- Article
- Export citation
- Cited by 11
Fast Strategies In Maker–Breaker Games Played on Random Boards
-
- Published online by Cambridge University Press:
- 10 September 2012, pp. 897-915
-
- Article
- Export citation
- Cited by 11
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 411-448
-
- Article
- Export citation
- Cited by 11
On 14-Cycle-Free Subgraphs of the Hypercube
-
- Published online by Cambridge University Press:
- 01 September 2009, pp. 725-729
-
- Article
- Export citation
- Cited by 11
The Intersection Exponent for Simple Random Walk
-
- Published online by Cambridge University Press:
- 14 February 2001, pp. 441-464
-
- Article
- Export citation
- Cited by 11
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 281-315
-
- Article
- Export citation