Journals in DBLP

Combinatorics, Probability & Computing
2002, volume: 11, number: 4

1. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
   Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
2. Edward Dobson
   Constructing Trees In Graphs Whose Complement Has No K2, S. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
3. Klaus Dohmen
   Bonferroni-Type Inequalities Via Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
4. Hsien-Kuei Hwang, Tsung-Hsi Tsai
   Quickselect And The Dickman Function. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
5. Marianne Månsson
   Pattern Avoidance And Overlap In Strings. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
6. Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
   Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
7. James G. Oxley, Dominic J. A. Welsh
   Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
   
8. András Telcs
   A Note On Rough Isometry Invariance Of Resistance. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]