Discrete Mathematics, Volume 68

Volume 68, Number 1, 1988

• H. L. Abbott, Meir Katchalski:
  Snakes and pseudo-snakes in powers of complete graphs. 1-8
  Electronic Edition (link) BibTeX
• Zhibo Chen, Fuji Zhang:
  Bounds of the longest directed cycle length for minimal strong digraphs. 9-13
  Electronic Edition (link) BibTeX
• John Greene:
  Bijections related to statistics on words. 15-29
  Electronic Edition (link) BibTeX
• John N. Hooker:
  Networklike metric spaces. 31-43
  Electronic Edition (link) BibTeX
• Christos Koukouvinos, Stratis Kounias:
  Hadamard matrices of the Williamson type of order 4·m, m=p·q an exhaustive search for m=33. 45-57
  Electronic Edition (link) BibTeX
• Stratis Kounias, Nikos Farmakis:
  On the excess of Hadamard matrices. 59-69
  Electronic Edition (link) BibTeX
• Germain Kreweras, Paul Moszkowski:
  Signatures des permutations et des mots extraits. 71-76
  Electronic Edition (link) BibTeX
• Bruce M. Landman, Raymond N. Greenwell:
  Values and bounds for Ramsey numbers associated with polynomial iteration. 77-83
  Electronic Edition (link) BibTeX
• Manoel Lemos:
  An extension of Lindström's result about characteristic sets of matroids. 85-101
  Electronic Edition (link) BibTeX
• Anne Delandtsheer:
  Line-primitive groups of small rank. 103-106
  Electronic Edition (link) BibTeX
• Mario Gionfriddo, Salvatore Milici:
  On the parameter v₂(h)<=6h for L₂-coloured graphs. 107-110
  Electronic Edition (link) BibTeX
• Alain Hertz, Dominique de Werra:
  Perfectly orderable graphs are quasi-parity graphs: a short proof. 111-113
  Electronic Edition (link) BibTeX

Volume 68, Numbers 2-3, 1988

• Timothy J. Carlson:
  Some unifying principles in Ramsey theory. 117-169
  Electronic Edition (link) BibTeX
• Ren Ding, Krzysztof Kolodziejczyk, John R. Reay:
  A new pick-type theorem on the hexagonal lattice. 171-177
  Electronic Edition (link) BibTeX
• Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
  Factors and induced subgraphs. 179-189
  Electronic Edition (link) BibTeX
• M. Reza Emamy-Khansary:
  On the covering cuts of c^d (d<=5). 191-196
  Electronic Edition (link) BibTeX
• Rainer Feix:
  On a property of graphs containing infinitely many isomorphic copies of themselves. 197-209
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs, Charles M. Grinstead, David R. Guichard:
  The number of maximal independent sets in a connected graph. 211-220
  Electronic Edition (link) BibTeX
• S. P. Gudder, G. T. Rüttimann:
  Finite function spaces and measures on hypergraphs. 221-244
  Electronic Edition (link) BibTeX
• S. P. Gudder, G. T. Rüttimann:
  Positive sets in finite linear function spaces. 245-255
  Electronic Edition (link) BibTeX
• Stephen C. Locke:
  Extremal 3-connected graphs. 257-263
  Electronic Edition (link) BibTeX
• Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West:
  The addition game: an abstraction of a communication problem. 265-272
  Electronic Edition (link) BibTeX
• Wiktor Piotrowski:
  Chordal characterization of graphic matroids. 273-279
  Electronic Edition (link) BibTeX
• Bruce E. Sagan:
  Inductive and injective proofs of log concavity results. 281-292
  Electronic Edition (link) BibTeX
• Benedict G. Seifert:
  On the arithmetic of cycles for the Collatz-Hasse ('Syracuse') conjectures. 293-298
  Electronic Edition (link) BibTeX
• John Sheehan:
  Graph decomposition with constraints on the minimum degree. 299-307
  Electronic Edition (link) BibTeX
• Joseph E. McCanna:
  Orientations of the n-cube with minimum diameter. 309-313
  Electronic Edition (link) BibTeX
• Robert B. Brown:
  Nonexistence of a regular graph design with upsilon = 17 and k = 6. 315-318
  Electronic Edition (link) BibTeX