Discrete Mathematics, Volume 201

Volume 201, Numbers 1-3, April 1999

• William T. Trotter:
  Editorial. 1-3
  Electronic Edition (link) BibTeX
• Geir Agnarsson, Stefan Felsner, William T. Trotter:
  The maximum number of edges in a graph of bounded dimension, with applications to ring theory. 5-19
  Electronic Edition (link) BibTeX
• Kenneth P. Bogart, Douglas B. West:
  A short proof that 'proper = unit'. 21-23
  Electronic Edition (link) BibTeX
• Graham Brightwell:
  Balanced pairs in partial orders. 25-52
  Electronic Edition (link) BibTeX
• Graham Brightwell, David A. Grable, Hans Jürgen Prömel:
  Forbidden induced partial orders. 53-80
  Electronic Edition (link) BibTeX
• Russ Bubley, Martin E. Dyer:
  Faster random generation of linear extensions. 81-88
  Electronic Edition (link) BibTeX
• Dwight Duffus, Bill Sands:
  An inequality for the sizes of prime filters of finite distributive lattices. 89-99
  Electronic Edition (link) BibTeX
• Stefan Felsner, Peter C. Fishburn, William T. Trotter:
  Finite three dimensional partial orders which are not sphere orders. 101-132
  Electronic Edition (link) BibTeX
• Serkan Hosten, Walter D. Morris:
  The order dimension of the complete graph. 133-139
  Electronic Edition (link) BibTeX
• Hal A. Kierstead:
  The dimension of two levels of the Boolean lattice. 141-155
  Electronic Edition (link) BibTeX
• Utz Leimich, Klaus Reuter:
  The fractional dimension of subsets of Boolean lattices and of cartesian products. 157-170
  Electronic Edition (link) BibTeX
• Zbigniew Lonc:
  On ordered sets without 2-colourings. 171-188
  Electronic Edition (link) BibTeX
• Ross M. McConnell, Jeremy Spinrad:
  Modular decomposition and transitive orientation. 189-241
  Electronic Edition (link) BibTeX