Discrete Mathematics, Volume 160

Volume 160, Numbers 1-3, November 1996

• Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao:
  Localizing combinatorial properties of partitions. 1-23
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Victor Chepoi:
  A Helly theorem in weakly modular space. 25-39
  Electronic Edition (link) BibTeX
• Lowell W. Beineke, Peter Hamburger, William D. Weakley:
  Random packing by rho-connected rho-regular graphs. 41-47
  Electronic Edition (link) BibTeX
• Frank E. Bennett, Charles J. Colbourn, Lie Zhu:
  Existence of three HMOLS of types hⁿ and 2ⁿ3¹. 49-65
  Electronic Edition (link) BibTeX
• Paul A. Catlin:
  The reduction of graph families closed under contraction. 67-80
  Electronic Edition (link) BibTeX
• Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai:
  Graphs without spanning closed trails. 81-91
  Electronic Edition (link) BibTeX
• Marc Chastand, Norbert Polat:
  Invariant Hamming graphs in infinite quasi-median graphs. 93-104
  Electronic Edition (link) BibTeX
• Raul Cordovil, António Guedes de Oliveira, Michel Las Vergnas:
  A generalized Desargues configuration and the pure braid group. 105-113
  Electronic Edition (link) BibTeX
• Paul Erdös, Peter C. Fishburn:
  Maximum planar sets that determine k distances. 115-125
  Electronic Edition (link) BibTeX
• Peter C. Fishburn, Peter L. Hammer:
  Bipartite dimensions and bipartite degrees of graphs. 127-148
  Electronic Edition (link) BibTeX
• H. H. Glover, T. Y. Yang:
  A Hamilton cycle in the Cayley graph of the <2, p, 3> presentation of PSL₂(p). 149-163
  Electronic Edition (link) BibTeX
• Chính T. Hoàng:
  Some properties of minimal imperfect graphs. 165-175
  Electronic Edition (link) BibTeX
• Dean G. Hoffman, C. A. Rodger:
  On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. 177-187
  Electronic Edition (link) BibTeX
• Eric Rémila:
  Tiling a simply connected figure with bars of length 2 or 3. 189-198
  Electronic Edition (link) BibTeX
• Carl G. Wagner:
  Generalized Stirling and Lah numbers. 199-218
  Electronic Edition (link) BibTeX
• Jiang Zeng:
  Multinomial convolution polynomials. 219-228
  Electronic Edition (link) BibTeX
• Yair Caro:
  On the generalized Erdös-Szekeres Conjecture - a new upper bound. 229-233
  Electronic Edition (link) BibTeX
• William Y. C. Chen:
  The skew, relative, and classical derangements. 235-239
  Electronic Edition (link) BibTeX
• Zhibo Chen:
  Harary's conjectures on integral sum graphs. 241-244
  Electronic Edition (link) BibTeX
• Karel Culík:
  An aperiodic set of 13 Wang tiles. 245-251
  Electronic Edition (link) BibTeX
• Ira M. Gessel:
  Counting acyclic digraphs by sources and sinks. 253-258
  Electronic Edition (link) BibTeX
• Jarkko Kari:
  A small aperiodic set of Wang tiles. 259-264
  Electronic Edition (link) BibTeX
• S. R. Kingan, James G. Oxley:
  On the matroids in which all hyperplanes are binary. 265-271
  Electronic Edition (link) BibTeX
• Ilia Krasikov:
  Degree conditions for vertex switching reconstruction. 273-278
  Electronic Edition (link) BibTeX
• Tibor Szabó:
  On nearly regular co-critical graphs. 279-281
  Electronic Edition (link) BibTeX
• Hong Wang, Charles H. C. Little, Kee L. Teo:
  Partition of a directed bipartite graph into two directed cycles. 283-289
  Electronic Edition (link) BibTeX
• Louxin Zhang, Lian Li, Jinzhao Wu:
  On the descriptive power of special Thue systems. 291-297
  Electronic Edition (link) BibTeX