Combinatorics, Probability and Computing

Table of Contents - Volume  22  - Issue 06 - Fri Nov 01 00:00:00 GMT 2013

Paper

Relative Tutte Polynomials of Tensor Products of Coloured Graphs

 
preview

Y. DIAO and G. HETYEI

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 801 - 828

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000370 (About DOI), Published online: Wed Sep 04 00:00:00 BST 2013

 

Post a Comment

Constructive Packings by Linear Hypergraphs

 
preview

JILL DIZONA and BRENDAN NAGLE

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 829 - 858

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000291 (About DOI), Published online: Thu Sep 12 00:00:00 BST 2013

 

Post a Comment

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs

 
preview

HAO HUANG, JIE MA, ASAF SHAPIRA, BENNY SUDAKOV and RAPHAEL YUSTER

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 859 - 873

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000394 (About DOI), Published online: Thu Sep 12 00:00:00 BST 2013

 

Post a Comment

On Independent Sets in Graphs with Given Minimum Degree

 
preview

HIU-FAI LAW and COLIN McDIARMID

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 874 - 884

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000369 (About DOI), Published online: Mon Sep 16 00:00:00 BST 2013

 

Post a Comment

Random Colourings and Automorphism Breaking in Locally Finite Graphs

 
preview

FLORIAN LEHNER

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 885 - 909

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000382 (About DOI), Published online: Mon Sep 16 00:00:00 BST 2013

 

Post a Comment

Minimum Number of k-Cliques in Graphs with Bounded Independence Number

 
preview

OLEG PIKHURKO and EMIL R. VAUGHAN

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 910 - 934

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000357 (About DOI), Published online: Tue Oct 01 00:00:00 BST 2013

 

Post a Comment

Counting Plane Graphs: Cross-Graph Charging Schemes

 
preview

MICHA SHARIR and ADAM SHEFFER

Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp 935 - 954

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S096354831300031X (About DOI), Published online: Thu Jul 25 00:00:00 BST 2013

 

Post a Comment

Front Cover (OFC, IFC) and matter

CPC volume 22 issue 6 Cover and Front matter

 
preview
Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp f1 - f2

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000424 (About DOI), Published online: Tue Oct 01 00:00:00 BST 2013

 

Post a Comment

Back Cover (IBC, OBC) and matter

CPC volume 22 issue 6 Cover and Back matter

 
preview
Combinatorics, Probability and Computing / Volume  22 / Issue 06 / Fri Nov 01 00:00:00 GMT 2013, pp b1 - b8

Copyright © Cambridge University Press 2013 

DOI: http://dx.doi.org/10.1017/S0963548313000436 (About DOI), Published online: Tue Oct 01 00:00:00 BST 2013

 

Post a Comment