Discrete Mathematics, Volume 113

Volume 113, Numbers 1-3, April 1993

• Dan Archdeacon, Jeffrey H. Dinitz:
  Indecomposable triple systems exist for all lambda. 1-6
  Electronic Edition (link) BibTeX
• Frank E. Bennett, J. Yin, Lie Zhu:
  On the existence of perfect Mendelsohn designs with k = 7 and lambda even. 7-25
  Electronic Edition (link) BibTeX
• Jason I. Brown, Stephen Watson:
  Mutually complementary partial orders. 27-39
  Electronic Edition (link) BibTeX
• Brian A. Davey, Hilary A. Priestley:
  Partition-induced natural dualities for varieties of pseudo- complemented distributive lattices. 41-58
  Electronic Edition (link) BibTeX
• Paul Erdös, Fred Galvin:
  Monochromatic infinite paths. 59-70
  Electronic Edition (link) BibTeX
• Roger Labahn:
  Information flows on hypergraphs. 71-97
  Electronic Edition (link) BibTeX
• Hanns-Georg Leimer:
  Optimal decomposition by clique separators. 99-123
  Electronic Edition (link) BibTeX
• Ko-Wei Lih:
  Rank inequalities for chordal graphs. 125-130
  Electronic Edition (link) BibTeX
• Kevin McAvaney, Jack M. Robertson, Duane Detemple:
  A characterization and hereditary properties for partitoon graphs. 131-142
  Electronic Edition (link) BibTeX
• Stephan Olariu:
  Quasi-brittle graphs, a new class of perfectly orderable graphs. 143-153
  Electronic Edition (link) BibTeX
• Mario Salvetti:
  On the homotopy theory of complexes associated to metrical-hemisphere complexes. 155-177
  Electronic Edition (link) BibTeX
• J. W. Sander:
  On maximal antihierarchic sets of integers. 179-189
  Electronic Edition (link) BibTeX
• James H. Schmerl, William T. Trotter:
  Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. 191-205
  Electronic Edition (link) BibTeX
• Werner Schwärzler, András Sebö:
  A generalized cut-condition for multiflows in matroids. 207-221
  Electronic Edition (link) BibTeX
• Thomas Zaslavsky:
  The projective-planar signed graphs. 223-247
  Electronic Edition (link) BibTeX
• Jochen Harant:
  Toughness and nonhamiltonicity of polyhedral graphs. 249-253
  Electronic Edition (link) BibTeX
• D. W. DeTemple, M. J. Dineen, J. M. Robertson, K. L. McAvaney:
  Recent examples in the theory of partition graphs. 255-258
  Electronic Edition (link) BibTeX
• Paul Erdös, Cecil C. Rousseau:
  The size Ramsey number of a complete bipartite graph. 259-262
  Electronic Edition (link) BibTeX
• I. P. Goulden, S. Pepper:
  Labelled trees and factorizations of a cycle into transpositions. 263-268
  Electronic Edition (link) BibTeX
• P. Katerinis:
  Regular factors in regular graphs. 269-274
  Electronic Edition (link) BibTeX
• Ernst Willem Lambeck:
  On distance regular graphs with c_i=b₁. 275-276
  Electronic Edition (link) BibTeX
• James E. Simpson:
  A bipartite Erdös-Ko-Rado theorem. 277-280
  Electronic Edition (link) BibTeX
• J. Yin, S. Wu:
  Four new BIBDs with block size seven. 281-284
  Electronic Edition (link) BibTeX
• Huishan Zhou:
  Chromatic difference sequences and homomorphisms. 285-292
  Electronic Edition (link) BibTeX