Volume 62, Number 1, September 2009
: Direct products of automorphism groups of graphs.
Volume 62, Number 2, October 2009
Paul S. Bonsma
: The complexity of the matching-cut problem for planar graphs and other graph classes.
: Complexity of clique-coloring odd-hole-free graphs.
: Packing two copies of a sparse graph into a graph with restrained maximum degree.
: Edge disjoint Steiner trees in graphs without large bridges.
Paul K. Stockmeyer
: Erratum to: "The falsity of the reconstruction conjecture for tournaments".
Volume 62, Number 3, November 2009
Volume 62, Number 4, December 2009