Journal of combinatorial theory. Series B

• 

  Año 2011, Vol. 101, Número 6

  • Fractional total colourings of graphs of high girth

    Tomás Kaiser, Andrew D. King, Daniel Král'

    págs. 383-402

    

  • On two generalizations of the Alon-Tarsi polynomial method

    Dan Hefetz

    págs. 403-414

    

  • An approximate version of Sumner's universal tournament conjecture

    Daniela Kühn, Richard Mycroft, Deryk Osthus

    págs. 415-447

    

  • Unexpected behaviour of crossing sequences

    Matt De Vos, Bojan Mohar, Robert Sámal

    págs. 448-463

    

  • Circular flow on signed graphs

    André Raspaud, Xuding Zhu

    págs. 464-479

    

  • Longest cycles in k-connected graphs with given independence number

    Suil O, Douglas B. West, Hehui Wu

    págs. 480-485

    

  • An odd characterization of the generalized odd graphs

    Edwin R. van Dam, Willem H. Haemers

    págs. 486-489

    

  • Entire colouring of plane graphs

    Weifan Wan, Xuding Zhu

    págs. 490-501

    

  • Linear connectivity forces large complete bipartite minors: An alternative approach

    Jan-Oliver Fröhlich, Theodor Müller

    págs. 502-508

    

  • A note on Thomassen's conjecture

    Domingos Dellamonica, Vojtech Rödl

    págs. 509-515