Journal of combinatorial theory. Series B

• 

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

  • The branchwidth of graphs and their cycle matroids

    Illya V. Hicks, Nolan B. Jr. McMurray

    • Resumen

    págs. 681-692

    

  • Projective-planar signed graphs and tangled signed graphs

    Daniel Slilaty

    • Resumen

    págs. 693-717

    

  • Directed tree-width examples

    Isolde Adler

    págs. 718-725

    

  • Laplacian spectral bounds for clique and independence numbers of graphs

    Mei Lu, Huiqing Liu, Feng Tian

    • Resumen

    págs. 726-732

    

  • Boxicity and treewidth

    L. Sunil Chandran, Naveen Sivadasan

    págs. 733-744

    

  • On the reconstruction of planar graphs

    Mark Bilinski, Young Soo Kwon, Xingxing Yu

    • Resumen

    págs. 745-756

    

  • Symmetric cubic graphs of small girth

    Marston D. E. Conder, Roman Nedela

    págs. 757-768

    

  • Generating bricks

    Serguei Norine, Robin Thomas

    • Resumen

    págs. 769-817

    

  • Primitive half-transitive graphs constructed from the symmetric groups of prime degrees

    Zai Ping Lu

    págs. 818-826

    

  • The nonorientable genus of joins of complete graphs with large edgeless graphs

    M.N. Ellingham, Christopher Stephens

    págs. 827-845

    

  • The relative clique-width of a graph

    Vadim Lozin, Dieter Rautenbach

    • Resumen

    págs. 846-858