Volume 100, Number 1, January 2010
: Graph edge colouring: Tashkinov trees and Goldberg's conjecture.
Volume 100, Number 2, March 2010
Cheng Yeaw Ku
, William Chen
: An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial.
: Packing non-zero A-paths in an undirected model of group labeled graphs.
, Bruce Reed
: Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246].
Volume 100, Number 3, May 2010
Volume 100, Number 4, July 2010
: Smallest counterexample to the 5-flow conjecture has girth at least eleven.
Volume 100, Number 5, September 2010
Volume 100, Number 6, November 2010
Joseph P. S. Kung
: Convolution-multiplication identities for Tutte polynomials of graphs and matroids.
: Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem.
, Alexander Araluze
: New tools for the construction of directed strongly regular graphs: Difference digraphs and partial sum families.
, Bojan Mohar
: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus.