Discrete Mathematics, Volume 93

Volume 93, Number 1, November 1991

• Shreeram S. Abhyankar, Sanjeevani B. Joshi:
  Generalized rodeletive correspondence between multitableaux and multimonomials. 1-17
  Electronic Edition (link) BibTeX
• Noboru Hamada, Michel Deza:
  A characterization of {2v_alpha+1 + 2v_beta+1, 2v_alpha + 2v_beta; t, q}- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes. 19-33
  Electronic Edition (link) BibTeX
• Wojciech Kordecki:
  Random subgraphs of the n-cycle and the n-wheel. 35-53
  Electronic Edition (link) BibTeX
• Ilia Krasikov:
  On a tree-cutting problem of P. Ash. 55-61
  Electronic Edition (link) BibTeX
• Michel Mollard:
  Two characterizations of generalized hypercube. 63-74
  Electronic Edition (link) BibTeX
• Wolfgang Schmidt:
  Greedoids and searches in directed graphs. 75-88
  Electronic Edition (link) BibTeX
• F. Reverdy-Vilotitch:
  La reconstruction au sens de Ulam de certaines multirelations binaires. 89-95
  Electronic Edition (link) BibTeX
• Manfred Stern:
  Dually atomistic lattices. 97-100
  Electronic Edition (link) BibTeX
• Koen Versmissen:
  Monohedral periodic tilings of the plane with any number of aspects. 101-108
  Electronic Edition (link) BibTeX

Volume 93, Numbers 2-3, November 1991

• Gary S. Bloom, D. Frank Hsu:
  Foreword. 111-113
  Electronic Edition (link) BibTeX
• Jaromir Abrham:
  Graceful 2-regular graphs and Skolem sequences. 115-121
  Electronic Edition (link) BibTeX
• B. Devadas Acharya, S. M. Hegde:
  Strongly indexable graphs. 123-129
  Electronic Edition (link) BibTeX
• Gary L. Ebert, Joe Hemmeter, Felix Lazebnik, Andrew J. Woldar:
  On the number of irregular assignments on a graph. 131-142
  Electronic Edition (link) BibTeX
• Tuvi Etzion:
  Combinatorial designs with Costas arrays properties. 143-154
  Electronic Edition (link) BibTeX
• Richard A. Gibbs, Peter J. Slater:
  Distinct distance sets in a graph. 155-165
  Electronic Edition (link) BibTeX
• Herbert Taylor:
  A distinct distance set of 9 nodes in a tree of diameter 36. 167-168
  Electronic Edition (link) BibTeX
• L. H. Harper:
  On a problem of Kleitman and West. 169-182
  Electronic Edition (link) BibTeX
• Mark Hovey:
  A-cordial graphs. 183-194
  Electronic Edition (link) BibTeX
• S. M. Lee, S. C. Shee:
  On skolem graceful graphs. 195-200
  Electronic Edition (link) BibTeX
• Sin-Min Lee, Edward F. Schmeichel, S. C. Shee:
  On felicitous graphs. 201-209
  Electronic Edition (link) BibTeX
• Zevi Miller, Dan Pritikin:
  The harmonious coloring number of a graph. 211-228
  Electronic Edition (link) BibTeX
• Fred S. Roberts:
  T-colorings of graphs: recent results and open problems. 229-245
  Electronic Edition (link) BibTeX
• Herbert Taylor:
  Florentine rows or left-right shifted permutation matrices with cross-correlation values >= 1. 247-260
  Electronic Edition (link) BibTeX