Discrete Mathematics, Volume 84

Volume 84, Number 1, August 1990

• Frank E. Bennett, Lisheng Wu, Lie Zhu:
  Further results on incomplete (3, 2, 1)- conjugate orthogonal idempotent Latin squares. 1-14
  
• Michael Gilpin, Robert Shelton:
  Predicates whose maximal length functions increase periodically. 15-21
  
• Peter Horák, Jozef Sirán:
  Solution of two problems of P. Erdös concerning Hamiltonian cycles. 23-29
  
• Lih-Hsing Hsu:
  Generalized homomorphism graph functions. 31-37
  
• Elzbieta B. Jarrett:
  Two families of graphs satisfying the cycle basis interpolation property. 39-46
  
• Ronald C. Mullin, Douglas R. Stinson:
  Pairwise balanced designs with odd block sizes exceeding five. 47-62
  
• Sadao Saito, Takanori Hayasaka:
  Langford sequences: Some connections with complete and additive permutations. 63-70
  
• Paul C. van Oorschot, Scott A. Vanstone:
  On splitting sets in block designs and finding roots of polynomials. 71-85
  
• Dave Witte:
  Hamilton-decomposable graphs and digraphs of infinite valence. 87-100
  
• Jin Akiyama, Jorge Urrutia:
  Simple alternating path problem. 101-103
  
• Nicola Martinov:
  A recursive characterization of the 4-connected graphs. 105-108
  

Volume 84, Number 2, September 1990

• Grahame Bennett:
  Coin tossing and moment sequences. 111-118
  
• Margaret Ann Francel:
  Possible orders for the stabilizer of a set of M.O.L.S. 119-134
  
• P. Frankl:
  An intersection problem for codes. 135-141
  
• Stanislav Jendrol, Michal Tkác:
  Convex 3-polytopes with exactly two types of edges. 143-160
  
• Christiane Lefevre-Percsy, L. Van Nypelseer:
  Finite rank 3 geometries with affine planes and dual affine point residues. 161-167
  
• Yanpei Liu:
  On chromatic and dichromatic sum equations. 169-179
  
• Ioan Tomescu:
  Almost all digraphs have a kernel. 181-192
  
• A. A. Chernyak, Zh. A. Chernyak:
  Pseudodomishold graphs. 193-196
  
• Roy Meshulam:
  An uncertainty inequality and zero subsums. 197-200
  
• Bernard Van Cutsem:
  Minimal superior ultrametrics under order constraint. 201-204
  
• Moh'd Z. Abu-Sbeih:
  On the number of spanning trees of K_n and K_{m, n}. 205-207
  
• Tom Knoblauch:
  Using triangles to partition a disk. 209-211
  
• Aditya Shastri:
  Lower bounds for bi-colored quaternary ramsey numbers. 213-216
  
• Douglas R. Woodall:
  A proof of McKee's eulerian-bipartite characterization. 217-220
  

Volume 84, Number 3, October 1990

• Frank E. Bennett, Beiliang Du, Lie Zhu:
  On the existence of (v, 7, 1)-perfect Mendelsohn designs. 221-239
  
• Bill Jackson, Oscar Ordaz:
  Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. 241-254
  
• J. T. Joichi:
  Hecke-Rogers, Andrews identities; combinatorial proofs. 255-259
  
• A. G. Robinson, A. J. Goldman:
  On the set coincidence game. 261-283
  
• Moshe Rosenfeld:
  The number of cycles in 2-factors of cubic graphs. 285-294
  
• Egon Schulte:
  On a glass of abstract polytopes constructed from binary codes. 295-301
  
• Michel Mollard, Charles Payan:
  Some progress in the packing of equal circles in a square. 303-307
  
• Ron Aharoni, Ofra Kessler:
  On a possible extension of Hall's theorem to bipartite hypergraphs. 309-313
  
• Hung-Lin Fu:
  A note on the ascending subgraph decomposition problem. 315-318
  
• Guy Giraud:
  Remarques sur deux problemes extremaux. 319-321
  
• Lajos Takács:
  Counting forests. 323-326