Volume 22, Number 1, 2008
: Faces of Generalized Cluster Complexes and Noncrossing Partitions.
: Tree-Related Widths of Graphs and Hypergraphs.
: L(2, 1)-Labeling of Hamiltonian graphs with Maximum Degree 3.
: Matroid Pathwidth and Code Trellis Complexity.
Volume 22, Number 2, 2008
: Polychromatic Colorings of Subcubes of the Hypercube.
: Matroid Complexity and Nonsuccinct Descriptions.
: Rank-Width and Well-Quasi-Ordering.
: The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane.
Volume 22, Number 3, 2008
: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs.
: Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski.
Paul S. Bonsma
: Spanning Trees with Many Leaves in Graphs With Minimum Degree Three.
Bhalchandra D. Thatte
: Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question.
Susan S. Wang
: Structure and Coloring of Graphs with Only Small Odd Cycles.
Csaba D. Tóth
: Axis-Aligned Subdivisions with Low Stabbing Numbers.
K. P. Webb
: The Vector Space over GF(2) Generated by the Common Bases of Two Binary Matroids.
Volume 22, Number 4, 2008
: Perfect Codes of Length n with Kernels of Dimension n-log(n+1)-3.
: Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.
, Petr Skoda
: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice.