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
Pattern Avoidance and Overlap in Strings
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 393-402
-
- Article
- Export citation
- Cited by 3
Decompositions into Subgraphs of Small Diameter
-
- Published online by Cambridge University Press:
- 09 June 2010, pp. 753-774
-
- Article
- Export citation
- Cited by 3
Period Lengths for Iterated Functions
-
- Published online by Cambridge University Press:
- 16 September 2010, pp. 289-298
-
- Article
- Export citation
- Cited by 3
Constrained Ramsey Numbers
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 247-258
-
- Article
- Export citation
- Cited by 3
Restricted completion of sparse partial Latin squares
- Part of:
-
- Published online by Cambridge University Press:
- 20 February 2019, pp. 675-695
-
- Article
- Export citation
- Cited by 3
Short proofs for long induced paths
- Part of:
-
- Published online by Cambridge University Press:
- 11 February 2022, pp. 870-878
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 3
Triangle-Freeness is Hard to Detect
-
- Published online by Cambridge University Press:
- 21 November 2002, pp. 549-569
-
- Article
- Export citation
- Cited by 3
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- Part of:
-
- Published online by Cambridge University Press:
- 09 October 2017, pp. 228-244
-
- Article
- Export citation
- Cited by 3
Counting Connected Hypergraphs via the Probabilistic Method
-
- Published online by Cambridge University Press:
- 04 January 2016, pp. 21-75
-
- Article
- Export citation
- Cited by 3
The Minimum Independence Number of a Hasse Diagram
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 473-475
-
- Article
- Export citation
- Cited by 3
Cycle partitions of regular graphs
- Part of:
-
- Published online by Cambridge University Press:
- 18 December 2020, pp. 526-549
-
- Article
- Export citation
- Cited by 3
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves†
- Part of:
-
- Published online by Cambridge University Press:
- 04 May 2016, pp. 941-958
-
- Article
- Export citation
- Cited by 3
Longest Path Distance in Random Circuits
-
- Published online by Cambridge University Press:
- 03 July 2012, pp. 856-881
-
- Article
- Export citation
- Cited by 3
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
-
- Published online by Cambridge University Press:
- 01 July 2008, pp. 537-548
-
- Article
- Export citation
- Cited by 3
Isoperimetric Problems for r-sets
-
- Published online by Cambridge University Press:
- 03 March 2004, pp. 277-279
-
- Article
- Export citation
- Cited by 3
A Binary Deletion Channel With a Fixed Number of Deletions
-
- Published online by Cambridge University Press:
- 07 October 2014, pp. 486-489
-
- Article
- Export citation
- Cited by 3
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle
- Part of:
-
- Published online by Cambridge University Press:
- 16 July 2018, pp. 241-252
-
- Article
- Export citation
- Cited by 3
On the structure of Dense graphs with bounded clique number
- Part of:
-
- Published online by Cambridge University Press:
- 05 June 2020, pp. 641-649
-
- Article
- Export citation
- Cited by 3
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs
-
- Published online by Cambridge University Press:
- 21 March 2012, pp. 512-514
-
- Article
- Export citation
- Cited by 3
On Extremal Set Partitions in Cartesian Product Spaces
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 211-220
-
- Article
- Export citation