Journals in DBLP

Combinatorics, Probability & Computing
2005, volume: 14, number: 3

1. Mindaugas Bloznelis
   Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:249-268 [Journal]
   
2. Onn Chan, Tao-Kai Lam
   Lifting Markov Chains to Random Walks on Groups. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:269-273 [Journal]
   
3. Keith Edwards
   Detachments of Complete Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:275-310 [Journal]
   
4. Peter L. Hammer, Igor E. Zverovich
   Construction of a Maximum Stable Set with $k$-Extensions. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:311-318 [Journal]
   
5. Norbert Hegyvári
   On Intersecting Properties of Partitions of Integers. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:319-323 [Journal]
   
6. Daniela Kühn, Deryk Osthus
   Packings in Dense Regular Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:325-337 [Journal]
   
7. Tamás F. Móri
   The Maximum Degree of the Barabasi-Albert Random Tree. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:339-348 [Journal]
   
8. Vladimir Nikiforov
   The Cycle-Complete Graph Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:349-370 [Journal]
   
9. Yuejian Peng, Vojtech Rödl, Jozef Skokan
   Counting Small Cliques in 3-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:371-413 [Journal]
   
10. Wolfgang Woess
    Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:415-433 [Journal]
    
11. Zoltán Füredi, András Gyárfás, Gábor Simonyi
    Connected matchings and Hadwiger's conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:435-438 [Journal]