Volume 27, Number 1, January 2006
Roy Meshulam:
An uncertainty inequality for finite abelian groups.
63-67
Sandi Klavzar:
On the canonical metric representation, average distance, and partial Hamming graphs.
68-73
Volume 27, Number 2, February 2006
Refik Keskin:
Suborbital graphs for the normalizer of Gamma0(m).
193-206
Hiroshi Suzuki:
The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra.
235-254
Robert Morris:
FC-families and improved bounds for Frankl's conjecture.
269-282
Ilse Fischer:
Another refinement of the Bender-Knuth (ex-)conjecture.
290-321
Volume 27, Number 3, April 2006
Hiroaki Kido:
Classification of isosceles eight-point sets in three-dimensional Euclidean space.
329-341
R. A. Bailey:
Generalized wreath products of association schemes.
428-435
Volume 27, Number 4, May 2006
Dan Bernstein:
A combinatorial proof of a bibasic trigonometric identity.
518-525
Cédric Lecouvey:
Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems Bn, Cn and Dn.
526-557
József Balogh:
A remark on the number of edge colorings of graphs.
565-573
Volume 27, Number 5, July 2006
Vsevolod F. Lev:
Permutations in abelian groups and the sequence n! (mod p).
635-643
Iwao Sato:
Weighted Bartholdi zeta functions of graphs.
644-657
Pierre Mazet:
Recouvrements Hamiltoniens de certains graphes.
739-749
Volume 27, Number 6, August 2006
Garth Isaak:
Hamiltonicity of digraphs for universal cycles of permutations.
801-805
Jim Lawrence:
The odd-even invariant of an oriented matroid.
806-813
Norihide Tokushige:
The maximum size of 4-wise 2-intersecting and 4-wise 2-union families.
814-825
Wei Wang,
Cheng-Xian Xu:
A sufficient condition for a family of graphs being determined by their generalized spectra.
826-840
Mitsugu Hirasaka:
Upper bounds given by equitable partitions of a primitive association scheme.
841-849
Jack E. Graver:
The independence numbers of fullerenes and benzenoids.
850-863
Rigoberto Flórez:
Lindström's conjecture on a class of algebraically non-representable matroids.
896-905
Vadim E. Levit,
Eugen Mandrescu:
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.
931-939
László Lovász:
The rank of connection matrices and the dimension of graph algebras.
962-970
David Meier:
On groups with the Lohse property.
1042-1053
Volume 27, Number 7, October 2006
Eurocomb '03 - Graphs and Combinatorial Structures
Jirí Fiala,
Jana Maxová:
Cantor-Bernstein type theorem for locally constrained graph homomorphisms.
1111-1116
Christian Krattenthaler:
Descending plane partitions and rhombus tilings of a hexagon with a triangular hole.
1138-1146
Reza Naserasr:
K5-Free bound for the class of planar graphs.
1155-1158
Alain Plagne:
On threshold properties of k-SAT: An additive viewpoint.
1186-1198
László Szegö:
On constructive characterizations of (k, l)-sparse graphs.
1211-1223
Volume 27, Number 8, November 2006
Special Issue on Extremal and Probabilistic Combinatorics
data released under the ODC-BY 1.0 license
