Volume 27, Number 1, January 2006
: An uncertainty inequality for finite abelian groups.
: On the canonical metric representation, average distance, and partial Hamming graphs.
Volume 27, Number 2, February 2006
: Suborbital graphs for the normalizer of Gamma0(m).
: The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra.
: FC-families and improved bounds for Frankl's conjecture.
: Another refinement of the Bender-Knuth (ex-)conjecture.
Volume 27, Number 3, April 2006
: Classification of isosceles eight-point sets in three-dimensional Euclidean space.
R. A. Bailey
: Generalized wreath products of association schemes.
Volume 27, Number 4, May 2006
: A combinatorial proof of a bibasic trigonometric identity.
: Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems Bn, Cn and Dn.
: A remark on the number of edge colorings of graphs.
Volume 27, Number 5, July 2006
Vsevolod F. Lev
: Permutations in abelian groups and the sequence n! (mod p).
: Weighted Bartholdi zeta functions of graphs.
: Recouvrements Hamiltoniens de certains graphes.
Volume 27, Number 6, August 2006
: Hamiltonicity of digraphs for universal cycles of permutations.
: The odd-even invariant of an oriented matroid.
: The maximum size of 4-wise 2-intersecting and 4-wise 2-union families.
, Cheng-Xian Xu
: A sufficient condition for a family of graphs being determined by their generalized spectra.
: Upper bounds given by equitable partitions of a primitive association scheme.
Jack E. Graver
: The independence numbers of fullerenes and benzenoids.
: Lindström's conjecture on a class of algebraically non-representable matroids.
Vadim E. Levit
, Eugen Mandrescu
: Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.
: The rank of connection matrices and the dimension of graph algebras.
: On groups with the Lohse property.
Volume 27, Number 7, October 2006
Eurocomb '03 - Graphs and Combinatorial Structures
, Jana Maxová
: Cantor-Bernstein type theorem for locally constrained graph homomorphisms.
: Descending plane partitions and rhombus tilings of a hexagon with a triangular hole.
: K5-Free bound for the class of planar graphs.
: On threshold properties of k-SAT: An additive viewpoint.
: On constructive characterizations of (k, l)-sparse graphs.
Volume 27, Number 8, November 2006
Special Issue on Extremal and Probabilistic Combinatorics