Discrete Mathematics, Volume 88

Volume 88, Number 1, March 1991

• Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
  Partitioning regular graphs into equicardinal linear forests. 1-9
  Electronic Edition (link) BibTeX
• Thomas Andreae, Martin Schughart, Zsolt Tuza:
  Clique-transversal sets of line graphs and complements of line graphs. 11-20
  Electronic Edition (link) BibTeX
• Konrad J. Heuvers, Daniel S. Moak:
  The solution of the Binet-Cauchy functional equation for square matrices. 21-32
  Electronic Edition (link) BibTeX
• C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard:
  On the structure of graphs uniquely hamiltonian-connected from a vertex. 33-48
  Electronic Edition (link) BibTeX
• Christos Koukouvinos, Stratis Kounias, Jennifer Seberry:
  Supplementary difference sets and optimal designs. 49-58
  Electronic Edition (link) BibTeX
• Esther R. Lamken:
  3-complementary frames and doubly near resolvable (v, 3, 2)- BIBDs. 59-78
  Electronic Edition (link) BibTeX
• Chiang Lin:
  The dimension of the cartesian product of posets. 79-92
  Electronic Edition (link) BibTeX
• Rodica Simion:
  Trees with 1-factors and oriented trees. 93-104
  Electronic Edition (link) BibTeX

Volume 88, Numbers 2-3, April 1991

• Martin Aigner, Rudolf Wille:
  Preface. 111
  Electronic Edition (link) BibTeX
• Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
  Partitioning a power set into union-free classes. 113-119
  Electronic Edition (link) BibTeX
• Thomas Andreae:
  A search problem on graphs which generalizes some group testing problems with two defectives. 121-127
  Electronic Edition (link) BibTeX
• Graham Brightwell, Jaroslav Nesetril:
  Reorientations of covering graphs. 129-132
  Electronic Edition (link) BibTeX
• Vincent Duquenne:
  The core of finite lattices. 133-147
  Electronic Edition (link) BibTeX
• Bernhard Ganter, Hans-Dietrich O. F. Gronau:
  Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions. 149-155
  Electronic Edition (link) BibTeX
• Gerhard Gierz, Ferdinand Hergert:
  The bandwidth problem for distributive lattices of breadth 3. 157-177
  Electronic Edition (link) BibTeX
• Daniel Grieser:
  Some results on the complexity of families of sets. 179-192
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs:
  Iterated exponentials of two numbers. 193-209
  Electronic Edition (link) BibTeX
• Michel Habib, David Kelly, Rolf H. Möhring:
  Interval dimension is a comparability invariant. 211-229
  Electronic Edition (link) BibTeX
• Hal A. Kierstead:
  A polynomial time approximation algorithm for dynamic storage allocation. 231-237
  Electronic Edition (link) BibTeX
• Wei-Ping Liu, Ivan Rival:
  Enumerating orientations of ordered sets. 239-247
  Electronic Edition (link) BibTeX
• Peter Luksch:
  Distributive lattices freely generated by an ordered set of width two. 249-258
  Electronic Edition (link) BibTeX
• Tom Madej, Douglas B. West:
  The interval inclusion number of a partially ordered set. 259-277
  Electronic Edition (link) BibTeX
• Oliver Pretzel, Dale Youngs:
  Balanced graphs and noncovering graphs. 279-287
  Electronic Edition (link) BibTeX
• Klaus Reuter:
  The jump number and the lattice of maximal antichains. 289-307
  Electronic Edition (link) BibTeX
• Rudolf Wille:
  The skeletons of free distributive lattices. 309-320
  Electronic Edition (link) BibTeX