Research Article
The Chromatic Number of Graph Powers
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 1-10
-
- Article
- Export citation
On the Lock-in Probability of Stochastic Approximation
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 11-20
-
- Article
- Export citation
The ‘Burnside Process’ Converges Slowly
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 21-34
-
- Article
- Export citation
Distinct Sums Modulo n and Tree Embeddings
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 35-42
-
- Article
- Export citation
On the Circuit Cover Problem for Mixed Graphs
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 43-59
-
- Article
- Export citation
Mappings on Decomposable Combinatorial Structures: Analytic Approach
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 61-78
-
- Article
- Export citation
Information Loss in Riffle Shuffling
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 79-95
-
- Article
- Export citation
A Note on Vertex-Disjoint Cycles
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 97-102
-
- Article
- Export citation
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 103-111
-
- Article
- Export citation