Discrete Mathematics, Volume 152

Volume 152, Numbers 1-3, May 1996

• Ron Aharoni, Uri Keich:
  A generalization of the Ahlswede-Daykin inequality. 1-12
  
• Noga Alon, Eldar Fischer:
  2-factors in dense graphs. 13-23
  
• Dragic Bankovic:
  Formulas of general solutions of Boolean equations. 25-32
  
• Andrei Baranga:
  Z-continuous posets. 33-45
  
• Andreas Brandstädt:
  Partitions of graphs into one or two independent sets and cliques. 47-54
  
• Gustav Burosch, Pier Vittorio Ceccherini:
  A characterization of cube-hypergraphs. 55-68
  
• Gustav Burosch, Hans-Dietrich O. F. Gronau, Jean-Marie Laborde, Ingo Warnke:
  On posets of m-ary words. 69-91
  
• Yair Caro:
  Zero-sum problems - A survey. 93-113
  
• Virgil Domocos:
  A combinatorial method for the enumeration of column-convex polyominoes. 115-123
  
• Dwight Duffus, Norbert Sauer:
  Lattices arising in categorial investigations of Hedetniemi's conjecture. 125-139
  
• Hortensia Galeana-Sánchez, H. A. Rincón-Mejía:
  Independent sets which meet all longest paths. 141-145
  
• Guogang Gao, Xuding Zhu:
  Star-extremal graphs and the lexicographic product. 147-156
  
• Jerrold R. Griggs, Owen Murphy:
  Edge density and independence ratio in triangle-free graphs with maximum degree three. 157-170
  
• Cosimo Guido:
  A larger class of reconstructible tournaments. 171-184
  
• Tor Helleseth, P. Vijay Kumar:
  On the weight hierarchy of the semiprimitive codes. 185-190
  
• Claire Kenyon, Eric Rémila:
  Perfect matchings in the triangular lattice. 191-210
  
• S. R. Kingan:
  Binary matroids without prisms, prism duals, and cubes. 211-224
  
• Tal Kubo, Ravi Vakil:
  On Conway's recursive sequence. 225-252
  
• Dingjun Lou:
  The Chvátal-Erdös condition for cycles in triangle-free graphs. 253-257
  
• Susan Marshall:
  On the existence of k-tournaments with given automorphism group. 259-268
  
• Michel Serfati:
  On postian algebraic equations. 269-285
  
• Douglas R. Woodall:
  An identity involving 3-regular graphs. 287-293
  
• Alexander A. Ageev:
  A triangle-free circle graph with chromatic number 5. 295-298
  
• Sylvain Gravier:
  A Hajós-like theorem for list coloring. 299-302
  
• S. D. Noble:
  Recognising a partitionable simplicial complex is in NP. 303-305
  
• John Noonan:
  The number of permutations containing exactly one increasing subsequence of length three. 307-313
  
• Darryn E. Bryant:
  A special class of nested Steiner triple systems. 315-320
  
• Carlos Flores, Oscar Ordaz:
  On the Erdös-Ginzburg-Ziv theorem. 321-324
  
• Baogang Xu, Hongbing Fan:
  On the fixed edge of planar graphs with minimum degree five. 325-328