Journal of combinatorial theory. Series B

• 

  Año 2007, Vol. 97, Número 4

  • Seleccionado

    Removing even crossings

    Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic

    • Resumen

    págs. 489-500

    
  • Seleccionado

    Distance constraints in graph color extensions

    Joan P. Hutchinson, Emily H. Moore

    • Resumen

    págs. 501-517

    
  • Seleccionado

    Minmax relations for cyclically ordered digraphs

    András Sebo

    • Resumen

    págs. 518-552

    
  • Seleccionado

    Contractions of 6-connected toroidal graphs

    Gasper Fijavz

    págs. 553-570

    
  • Seleccionado

    Exponentially many 5-list-colorings of planar graphs

    Carsten Thomassen

    • Resumen

    págs. 571-583

    
  • Seleccionado

    The Ramsey number for a triple of long even cycles

    Agnieszka Figaj, Tomasz Luczak

    págs. 584-596

    
  • Seleccionado

    Amalgamations of factorizations of complete graphs

    Matthew Johnson

    págs. 597-611

    
  • Seleccionado

    Induced subgraphs of Ramsey graphs with many distinct degrees

    Boris Bukh, Benny Sudakov

    págs. 612-619

    
  • Seleccionado

    Paths with two blocks in n-chromatic digraphs

    Louigi Addario-Berry, F. Havet, Stéphan Thomassé

    págs. 620-626

    
  • Seleccionado

    Cubic symmetric graphs of order a small number times a prime or a prime square

    Yan-Quan Feng, Jin Ho Kwak

    págs. 627-646

    
  • Seleccionado

    relaxed Hadwiger's Conjecture for list colorings

    Ken-ichi Kawarabayashi, Bojan Mohar

    págs. 647-651

    
  • Seleccionado

    Relaxed two-coloring of cubic graphs

    Robert Berke, Tibor Szabó

    • Resumen

    págs. 652-668

    
  • Seleccionado

    A new generalization of Mantel's theorem to k-graphs

    Dhruv Mubayi, Oleg Pikhurko

    págs. 669-678