Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Vol. 15 Issue 03

 

Log In

Browse Journals

Special Sales

Cambridge Journals Digital Archive

Click here for details about our archive digitisation project. more details

2009 Journals Catalogue

Click here to download a PDF of our latest catalogue; a comprehensive guide to all of our journals. more details

CJO Now Includes:

568,935 articles from 321 leading journals.

Customize Your Search Toolbar

Combinatorics, Probability and Computing

Search

Social Bookmarking

  • Note: Abstract, PDF and HTML open in a new window

  • Editor(s):
  • Béla Bollobás, DPMMS, Cambridge, UK; University of Memphis, USA

Sort by

Previous Issue Next Issue

Table of Contents - Volume 15 - Issue 03  

  Please select Articles below or use Select All, then click the appropriate button above. Select/Deselect All:
 

Paper

 
 

Random Lifts of Graphs: Edge Expansion

ALON AMIT and NATHAN LINIAL

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 317-332
doi:10.1017/S0963548305007273 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

Generating Outerplanar Graphs Uniformly at Random

MANUEL BODIRSKY and MIHYUN KANG

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 333-343
doi:10.1017/S0963548305007303 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model

MARIA DEIJFEN and OLLE HÄGGSTRÖM

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 345-353
doi:10.1017/S0963548305007315 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

Splitter Theorems for Cubic Graphs

GUOLI DING and JINKO KANNO

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 355-375
doi:10.1017/S0963548305007340 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

The Complexity of Counting Colourings of Subgraphs of the Grid

G. E. FARR

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 377-383
doi:10.1017/S0963548305007364 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

OMER GIMÉNEZ and MARC NOY

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 385-395
doi:10.1017/S0963548305007327 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

The Tutte Polynomial for Matroids of Bounded Branch-Width

PETR HLINENÝ

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 397-409
doi:10.1017/S0963548305007297 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs

RUSSELL MARTIN and DANA RANDALL

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 411-448
doi:10.1017/S0963548305007352 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

Evaluating the Rank Generating Function of a Graphic 2-Polymatroid

S. D. NOBLE

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 449-461
doi:10.1017/S0963548305007285 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors

THOMAS VOIGT and GÜNTER M. ZIEGLER

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 463-471
doi:10.1017/S0963548305007339 (About doi), Published Online by Cambridge University Press 07 Apr 2006
 

PROBLEM SECTION

 
 

The Minimum Independence Number of a Hasse Diagram

JIRÍ MATOUŠEK and ALEŠ PRÍVETIVÝ

Combinatorics, Probability and Computing, Volume 15, Issue 03, May 2006, pp 473-475
doi:10.1017/S0963548305007200 (About doi), Published Online by Cambridge University Press 07 Apr 2006
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press