- Tomasz Luczak, Vojtech Rödl, Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7(4): 423-436 (1998) - András Lukács:
On Local Expansion of Vertex-Transitive Graphs. Comb. Probab. Comput. 7(2): 205-209 (1998) - Brendan D. McKay, Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. Comb. Probab. Comput. 7(4): 437-449 (1998) - Akira Maruoka, Mike Paterson, Hirotaka Koizumi:
Consistency of Natural Relations on Sets. Comb. Probab. Comput. 7(3): 281-293 (1998) - Michael Molloy, Bruce A. Reed:
The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Comb. Probab. Comput. 7(3): 295-305 (1998) - Michele Mosca:
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. Comb. Probab. Comput. 7(2): 211-216 (1998) - Steven D. Noble:
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. Comb. Probab. Comput. 7(3): 307-321 (1998) - János Pach, Micha Sharir:
On the Number of Incidences Between Points and Curves. Comb. Probab. Comput. 7(1): 121-127 (1998) - Andrzej Pelc, Eli Upfal:
Reliable Fault Diagnosis with Few Tests. Comb. Probab. Comput. 7(3): 323-333 (1998) - Petr Savický:
Complexity and Probability of Some Boolean Formulas. Comb. Probab. Comput. 7(4): 451-463 (1998) - Richard H. Schelp, Andrew Thomason:
A Remark on the Number of Complete and Empty Subgraphs. Comb. Probab. Comput. 7(2): 217-219 (1998) - Shuji Shiraishi:
On the Maximum Cut of Line Graphs. Comb. Probab. Comput. 7(3): 335-337 (1998) - Kyle Siegrist:
Expected Value Expansions in Random Subgraphs with Applications to Network Reliability. Comb. Probab. Comput. 7(4): 465-483 (1998) - William T. Trotter, Peter Winkler:
Ramsey Theory and Sequences of Random Variables. Comb. Probab. Comput. 7(2): 221-238 (1998) - Haidong Wu:
On Vertex-Triads in 3-Connected Binary Matroids. Comb. Probab. Comput. 7(4): 485-497 (1998)
