Discrete Mathematics, Volume 131

Volume 131, Numbers 1-3, August 1994

• Ron Aharoni, Vladimir Korman:
  Strong LP duality in weighted infinite bipartite graphs. 1-7
  
• Rudolf Ahlswede, Levon H. Khachatrian:
  The maximal length of cloud-antichains. 9-15
  
• David Avis, Hiroshi Maehara:
  Metric extensions and the L¹ hierarchy. 17-28
  
• Bayoumi I. Bayoumi, Mohamed H. El-Zahar, Soheir M. Khamis:
  Counting two-dimensional posets. 29-37
  
• Stathis Chadjiconstantinidis, Theodore Chadjipadelis:
  A construction method of new D-, A-optimal weighing designs when N=3 mod 4 and k>=N-1. 39-50
  
• David P. Dailey:
  On the graphical containment of discrete metric spaces. 51-66
  
• Caterina De Simone, Anna Galluccio:
  New classes of Berge perfect graphs. 67-79
  
• Gary L. Ebert:
  Inverse planes with a given collection of common blocks. 81-90
  
• Saad El-Zanati:
  Maximum packings with odd cycles. 91-97
  
• Robert B. Gardner:
  Steiner triple systems with transrotational automorphisms. 99-104
  
• Kathy Williamson Hoke, M. F. Troyon:
  The struction algorithm for the maximum stable set problem revisited. 105-113
  
• H. A. Jung:
  On finite fixed sets in infinite graphs. 115-125
  
• Esther R. Lamken:
  Constructions for generalized balanced tournament designs. 127-151
  
• Manoel Lemos:
  Matroids having the same connectivity function. 153-161
  
• Jiuqiang Liu:
  Hamiltonian decompositions of Cayley graphs on Abelian groups. 163-171
  
• Zbigniew Lonc:
  Partitions of large Boolean lattices. 173-181
  
• Zevi Miller, Dan Pritikin:
  Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. 183-194
  
• Daniel S. Moak, Konrad J. Heuvers, K. P. S. Bhaskara Rao, Karen L. Collins:
  An inversion relation of multinomial type. 195-204
  
• B. Radhakrishnan Nair, A. Vijayakumar:
  About triangles in a graph and its complement. 205-210
  
• Adrian Riskin, David W. Barnette:
  On the noninterpolation of polyhedral maps. 211-219
  
• Egon Schulte, Asia Ivic Weiss:
  Chirality and projective linear groups. 221-261
  
• Alexander Sidorenko:
  A partially ordered set of functionals corresponding to graphs. 263-277
  
• Werner Siemes, Jerzy Topp, Lutz Volkmann:
  On unique independent sets in graphs. 279-285
  
• Lin Tan:
  Signs in the Laplace expansions and the parity of the distinguished representatives. 287-299
  
• Tao Wang:
  Factors of trees. 301-310
  
• Harold N. Ward:
  Divisors of codes of Reed-Muller type. 311-323
  
• Yeong-Nan Yeh:
  The generating polynomial and Euler characteristic of intersection graphs. 325-333
  
• Neil J. Calkin:
  A curious binomial identity. 335-337
  
• Aart Blokhuis, Tamás Szönyi:
  Irregular weighting of 1-designs. 339-343
  
• Patrick Headley:
  R-sequenceability and R^*-sequenceability of abelian 2-groups. 345-350
  
• Michael D. Hirschhorn:
  Ramanujan's partition congruences. 351-355
  
• P. Katerinis:
  Regular factors in vertex-deleted subgraphs of regular graphs. 357-361
  
• Danuta Michalak:
  The binding numbers of some Cartesian products of graphs. 363-366
  
• James Sellers:
  New congruences for generalized Frobenius partitions with two or three colors. 367-373
  
• Grzegorz Stachowiak:
  On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains. 375-378
  
• Janez Zerovnik:
  A randomized algorithm for k-colorability. 379-393