Journal of combinatorial theory. Series B

• 

  Año 2015, Número 111

  • Edge-disjoint double rays in infinite graphs: a Halin type result

    Nathan Bowler, Johannes Carmesin, Julian Pott

    págs. 1-16

    

  • The computational complexity of disconnected cut and 2K2-partition

    Barnaby Martin, Daniël Paulusma

    págs. 17-37

    

  • Tree-width and planar minors

    Alexander Leaf, Paul D. Seymour

    págs. 38-53

    

  • 2-Arc-transitive metacyclic covers of complete graphs

    Wenqin Xu, Shaofei Du, Jin Ho Kwak, Ming-Yao Xu

    págs. 54-74

    

  • The Erdos�Hajnal conjecture for rainbow triangles

    Jacob Fox, Andrey Grinshpun, János Pach

    págs. 75-125

    

  • Counting matroids in minor-closed classes

    R. A. Pendavingh, J. G. Van der Pol

    págs. 126-147

    

  • Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs

    Primoz Potocnik, Pablo Spiga, Gabriel Verret

    págs. 148-180

    

  • On zero-free intervals of flow polynomials

    F. M. Dong

    págs. 181-200

    

  • Cops and Robbers is EXPTIME-complete

    William B. Kinnersley

    págs. 201-220

    

  • Finite structure for Friedman ideals of finite trees

    Yared Nigussie

    págs. 221-233

    

  • Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs

    Luke Postle, Robin Thomas

    págs. 234-241

    

  • Exact bounds for some hypergraph saturation problems

    Guy Moshkovitz, Asaf Shapira

    págs. 242-248

    

  • Every totally real algebraic integer is a tree eigenvalue

    Justin Salez

    págs. 249-256