Discrete Mathematics, Volume 133

Volume 133, Numbers 1-3, October 1994

• Shreeram S. Abhyankar, Ikkwon Yie:
  Small degree coverings of the affine line in characteristic two. 1-23
  Electronic Edition (link) BibTeX
• Shreeram S. Abhyankar, Jun Ou, Avinash Sathaye:
  Alternating group coverings of the affine line for characteristic two. 25-46
  Electronic Edition (link) BibTeX
• Ahmed M. Assaf:
  Bipacking pairs by quintuples: The case nu=13 (mod 20). 47-54
  Electronic Edition (link) BibTeX
• Frank W. Barnes:
  How many 1×2×4 bricks can you get into an odd box? 55-78
  Electronic Edition (link) BibTeX
• Luigi Cerlienco, Marina Mureddu:
  Generalized Robinson-Schensted correspondences: a new algorithm. 79-88
  Electronic Edition (link) BibTeX
• Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson:
  Contractible edges in longest cycles in non-Hamiltonian graphs. 89-98
  Electronic Edition (link) BibTeX
• Winfried Geyer:
  On Tamari lattices. 99-122
  Electronic Edition (link) BibTeX
• Robert B. Hughes:
  Lower bounds on cube simplexity. 123-138
  Electronic Edition (link) BibTeX
• Alexander V. Ivashchenko:
  Some properties of contractible transformations on graphs. 139-145
  Electronic Edition (link) BibTeX
• Zygmunt Jackowski:
  Characterizations of two classes of digraphs. 147-157
  Electronic Edition (link) BibTeX
• Ming Jiang, Frank Ruskey:
  Determining the hamilton-connectedness of certain vertex-transitive graphs. 159-169
  Electronic Edition (link) BibTeX
• Hiroshi Kimura:
  Classification of Hadamard matrices of order 28. 171-180
  Electronic Edition (link) BibTeX
• R. Klein:
  On the colorability of m-composed graphs. 181-190
  Electronic Edition (link) BibTeX
• Jan Kratochvíl:
  Regular codes in regular graphs are difficult. 191-205
  Electronic Edition (link) BibTeX
• Eric Mendelsohn, P. Rodney:
  The existence of court balanced tournament designs. 207-216
  Electronic Edition (link) BibTeX
• David J. Rasmussen, Carla D. Savage:
  Hamilto-connected derangement graphs on S n. 217-223
  Electronic Edition (link) BibTeX
• James H. Schmerl:
  Tiling space with notched cubes. 225-235
  Electronic Edition (link) BibTeX
• Marcin J. Schroeder:
  Dependence systems with the operator-image exchange property. 237-248
  Electronic Edition (link) BibTeX
• Yongbing Shi:
  The number of cycles in a hamilton graph. 249-257
  Electronic Edition (link) BibTeX
• B. Uhrin:
  The set of neighbours of a set in a point-lattice. 259-266
  Electronic Edition (link) BibTeX
• Shaoji Xu:
  Classes of chromatically equivalent graphs and polygon trees. 267-278
  Electronic Edition (link) BibTeX
• Horst Alzer:
  An inequality for increasing sequences and its integral analogue. 279-283
  Electronic Edition (link) BibTeX
• Paul L. Check, Charles J. Colbourn:
  Concerning difference families with block size four. 285-289
  Electronic Edition (link) BibTeX
• D. Frank Hsu, Tomasz Luczak:
  On the k-diameter of k-regular k-connected graphs. 291-296
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Uros Milutinovic:
  Strong products of Kneser graphs. 297-300
  Electronic Edition (link) BibTeX
• Anping Li:
  On the conjecture at two counterfeit coins. 301-306
  Electronic Edition (link) BibTeX
• Hunter S. Snevily:
  The snake-in-the-box problem: A new upper bound. 307-314
  Electronic Edition (link) BibTeX
• Jun-Ming Xu:
  A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. 315-318
  Electronic Edition (link) BibTeX
• Min Song Zeng, Zhang Ke Min:
  Neighborhood unions and Hamiltonian properties. 319-324
  Electronic Edition (link) BibTeX
• Ke Min Zhang, Yannis Manoussakis, Zeng Min Song:
  Complementary cycles containing a fixed arc in diregular bipartite tournaments. 325-328
  Electronic Edition (link) BibTeX