Journal of combinatorial theory. Series B

• 

  Año 2014, Número 109

  • Spanning closed walks and TSP in 3-connected planar graphs

    Ken-ichi Kawarabayashi, Kenta Ozeki

    págs. 1-33

    

  • Hamilton cycles in dense vertex-transitive graphs

    Demetres Christofides, Jan Hladky, András Máthé

    págs. 34-72

    

  • Ore's conjecture on color-critical graphs is almost true

    Alexandr V. Kostochka, Matthew Yancey

    págs. 73-101

    

  • Colouring edges with many colours in cycles

    Jaroslav Nesetril, Patrice Ossona de Mendez, X. Zhu

    págs. 102-119

    

  • What is Ramsey-equivalent to a clique?

    Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó

    págs. 120-133

    

  • Colouring graphs when the number of colours is almost the maximum degree

    Michael Molloy, Bruce Reed

    págs. 134-195

    

  • The inducibility of blow-up graphs

    Hamed Hatami, James Hirst, Serguei Norine

    págs. 196-212

    

  • On generalized Ramsey numbers of Erdos and Rogers

    Andrzej Dudek, Troy Retter, Vojtech Rödl

    págs. 213-227

    

  • Tournaments with near-linear transitive subsets

    Krzysztof Choromanski, Maria Chudnovsky, Paul D. Seymour

    págs. 228-249

    

  • On the number of K4 -saturating edges

    József Balogh, Hong Liu

    págs. 250-257

    

  • An entropy argument for counting matroids

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

    págs. 258-262