Discrete Mathematics, Volume 69

Volume 69, Number 1, March 1988

• Ian Anderson:
  An Erdös-Ko-Rado theorem for multisets. 1-9
  Electronic Edition (link) BibTeX
• Achim Bachem, Walter Kern:
  On sticky matroids. 11-18
  Electronic Edition (link) BibTeX
• Mark N. Ellingham:
  Isomorphic factorization of r-regular graphs into r parts. 19-34
  Electronic Edition (link) BibTeX
• András Gyárfás, Michael S. Jacobson, Lael F. Kinch:
  On a generalization of transitivity for digraphs. 35-41
  Electronic Edition (link) BibTeX
• Hong-Jian Lai:
  On the Hamiltonian index. 43-53
  Electronic Edition (link) BibTeX
• Guizhen Liu:
  A lower bound on connectivities of matroid base graphs. 55-60
  Electronic Edition (link) BibTeX
• Francesco M. Malvestuto:
  Existence of extensions and product extensions for discrete probability distributions. 61-77
  Electronic Edition (link) BibTeX
• Gary L. Mullen:
  Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. 79-84
  Electronic Edition (link) BibTeX
• Bing Zhou:
  The maximum number of cycles in the complement of a tree. 85-94
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Isomorphism of two infinite-chromatic triangle-free graphs. 95
  Electronic Edition (link) BibTeX
• Robert Grone, Russell Merris:
  A bound for the complexity of a simple graph. 97-99
  Electronic Edition (link) BibTeX
• Friedrich Otto:
  An example of a one-relator group that is not a one-relation monoid. 101-103
  Electronic Edition (link) BibTeX

Volume 69, Number 2, April 1988

• Abraham Berman, Anton Kotzig:
  Cross-cloning and antipodal graphs. 107-114
  Electronic Edition (link) BibTeX
• Larry J. Brant, Gary L. Mullen:
  A study of frequency cubes. 115-121
  Electronic Edition (link) BibTeX
• Thomas H. Brylawski, Elaine Dieter:
  Exchange systems. 123-151
  Electronic Edition (link) BibTeX
• G. F. Clements:
  On multiset k-families. 153-164
  Electronic Edition (link) BibTeX
• M. Conforti, M. Laurent:
  A characterization of matroidal systems of inequalities. 165-171
  Electronic Edition (link) BibTeX
• Victor Neumann-Lara, Jorge Urrutia:
  A combinatorial result on points and circles on the plane. 173-178
  Electronic Edition (link) BibTeX
• Erwin Pesch:
  Products of absolute retracts. 179-188
  Electronic Edition (link) BibTeX
• Shao-Ji Xu:
  On sigma-polynomials. 189-194
  Electronic Edition (link) BibTeX
• Robert R. Korfhage:
  A note on quadratic sigma-polynomials. 195-196
  Electronic Edition (link) BibTeX
• Hartmut Laue:
  A graph theoretic proof of the fundamental trace identity. 197-198
  Electronic Edition (link) BibTeX
• Chengde Wang:
  On the sum of two parameters concerning independence and irredundance in a graph. 199-202
  Electronic Edition (link) BibTeX
• David C. Fisher:
  The number of triangles in a K₄-free graph. 203-205
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez:
  A new method to extend kernel-perfect graphs to kernel-perfect critical graphs. 207-209
  Electronic Edition (link) BibTeX
• A. F. Sidorenko:
  An infinite permutation without arithmetic progressions. 211
  Electronic Edition (link) BibTeX

Volume 69, Number 3, May 1988

• Kiran B. Chilakamarri:
  Unit-distance graphs in rational n-spaces. 213-218
  Electronic Edition (link) BibTeX
• Graham Farr:
  The complexity of multicolouring. 219-223
  Electronic Edition (link) BibTeX
• Klaus G. Fischer:
  Symmetric polynomials and Hall's theorem. 225-234
  Electronic Edition (link) BibTeX
• J. D. Key, N. K. A. Rostom:
  Unitary designs with regular sets of points. 235-239
  Electronic Edition (link) BibTeX
• K. M. Koh, K. S. Poh:
  Products of graphs with their closed-set lattices. 241-251
  Electronic Edition (link) BibTeX
• P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
  Adamant digraphs. 253-261
  Electronic Edition (link) BibTeX
• Rudolf Mathon:
  On self-complementary strongly regular graphs. 263-281
  Electronic Edition (link) BibTeX
• Hirobumi Mizuno, Iwao Sato:
  Ramsey numbers for unions of some cycles. 283-294
  Electronic Edition (link) BibTeX
• Grattan Murphy, Ren Ding:
  Grünbaum's gap conjecture. 295-300
  Electronic Edition (link) BibTeX
• Ortrud R. Oellermann:
  The connected cutset connectivity of a graph. 301-308
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, P. D. Johnson:
  Reverse class critical multigraphs. 309-311
  Electronic Edition (link) BibTeX
• Yongcai Liu:
  Construction and counting or generalized Boolean functions. 313-316
  Electronic Edition (link) BibTeX
• Ronald C. Read:
  A note on the chromatic uniqueness of W₁₀. 317
  Electronic Edition (link) BibTeX