Combinatorica

• 

  Año 2010, Vol. 30, Número 6

  • The generalized almost resolvable cycle system problem

    Peter Adams, Elizabeth J. Billington, D. G. Hoffman, C. C. Lindner

    págs. 617-625

    

  • On properties of random dissections and triangulations

    Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

    págs. 627-654

    

  • Asymptotic enumeration of integer matrices with large equal row and column sums

    E. Rodney Canfield, Brendan D. McKay

    págs. 655-680

    

  • The homology of a locally finite graph with ends

    Reinhard Diestel, Philipp Sprüssel

    págs. 681-714

    

  • Algorithms for finding an induced cycle in planar graphs

    Ken-ichi Kawarabayashi, Yusuke Kobayashi

    págs. 715-734

    

  • An asymptotic bound for the complexity of monotone graph properties

    Torsten Korneffel, Eberhard Triesch

    págs. 735-743