Discrete Mathematics, Volume 49

Volume 49, Number 1, March 1984

• Rudolf Ahlswede, Abbas El Gamal, King F. Pang:
  A two-family extremal problem in hamming space. 1-5
  Electronic Edition (link) BibTeX
• Robert B. Allan, Renu Laskar, Stephen T. Hedetniemi:
  A note on total domination. 7-13
  Electronic Edition (link) BibTeX
• Mao-cheng Cai:
  On separating systems of graphs. 15-20
  Electronic Edition (link) BibTeX
• C. C. Chen, K. M. Koh, S. C. Lee:
  On the grading numbers of direct products of chains. 21-26
  Electronic Edition (link) BibTeX
• Marsha F. Foregger:
  The skew chromatic index of a graph. 27-39
  Electronic Edition (link) BibTeX
• Ira M. Gessel:
  Some generalized Durfee square identities. 41-44
  Electronic Edition (link) BibTeX
• Pavol Hell, David G. Kirkpatrick:
  Packings by cliques and by finite families of graphs. 45-59
  Electronic Edition (link) BibTeX
• G. R. T. Hendry:
  Graphs uniquely hamiltonian-connected from a vertex. 61-74
  Electronic Edition (link) BibTeX
• Joseph P. S. Kung:
  Jacobi's identity and the König-Egerváry theorem. 75-77
  Electronic Edition (link) BibTeX
• Gunter Lassmann:
  On 4-isomorphisms of graphs. 79-81
  Electronic Edition (link) BibTeX
• Victor Neumann-Lara, Jorge Urrutia:
  Vertex critical r-dichromatic tournaments. 83-87
  Electronic Edition (link) BibTeX
• Rodica Simion:
  The lattice automorphisms of the dominance ordering. 89-93
  Electronic Edition (link) BibTeX
• R. E. Strong:
  Group actions on finite spaces. 95-100
  Electronic Edition (link) BibTeX
• Andries E. Brouwer:
  Distance regular graphs of diameter 3 and strongly regular graphs. 101-103
  Electronic Edition (link) BibTeX
• Jirí Tuma:
  Note on binary simplicial matroids. 105-107
  Electronic Edition (link) BibTeX

Volume 49, Number 2, April 1984

• Curtis A. Barefoot:
  Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. 109-112
  Electronic Edition (link) BibTeX
• Lynn Margaret Batten:
  Rank functions of closure spaces of finite rank. 113-116
  Electronic Edition (link) BibTeX
• Lucian Beznea:
  A topological characterization of complete distributive lattices. 117-120
  Electronic Edition (link) BibTeX
• Afrodita Iorgulescu:
  Functors between categories of three-valued Lukasiewicz-Moisil algebras I. 121-131
  Electronic Edition (link) BibTeX
• Francesco Mazzocca:
  On a class of lattices associated with n-cubes. 133-138
  Electronic Edition (link) BibTeX
• Armel Mercier:
  Quelques identités de l'analyse combinatoire. 139-149
  Electronic Edition (link) BibTeX
• K. R. Parthasarathy, N. Srinivasan:
  An extremal problem in geodetic graphs. 151-159
  Electronic Edition (link) BibTeX
• Ján Plesník:
  A note on the complexity of finding regular subgraphs. 161-167
  Electronic Edition (link) BibTeX
• H. J. Ryser:
  Matrices and set differences. 169-173
  Electronic Edition (link) BibTeX
• William Staton:
  Induced forests in cubic graphs. 175-178
  Electronic Edition (link) BibTeX
• Fumikazu Tamari:
  On linear codes which attain the Solomon-Stiffler bound. 179-191
  Electronic Edition (link) BibTeX
• R. Aravamudhan, B. Rajendran:
  On antipodal graphs. 193-195
  Electronic Edition (link) BibTeX
• Béla Bollobás, Ernest J. Cockayne:
  The irredundance number and maximum degree of a graph. 197-199
  Electronic Edition (link) BibTeX
• Aruna Sharma:
  A note on stability of graphs. 201-203
  Electronic Edition (link) BibTeX
• A. Donald Keedwell:
  More super p-groups. 205-207
  Electronic Edition (link) BibTeX
• Michel Mollard:
  Une nouvelle famille de 3-codes parfaits sur GF(q). 209-212
  Electronic Edition (link) BibTeX
• Vladimir D. Tonchev:
  The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas partial geometries. 213-217
  Electronic Edition (link) BibTeX
• Brian Alspach:
  Research problems. 219
  Electronic Edition (link) BibTeX

Volume 49, Number 3, May 1984

• George E. Andrews, David M. Bressoud:
  Identities in combinatorics III: Further aspects of ordered set sorting. 223-236
  Electronic Edition (link) BibTeX
• Ronald V. Book, Craig C. Squier:
  Almost all one-rule thue systems have decidable word problems. 237-240
  Electronic Edition (link) BibTeX
• Andrei Z. Broder:
  The r-Stirling numbers. 241-259
  Electronic Edition (link) BibTeX
• Charles Delorme, Gena Hahn:
  Infinite generalized friendship graphs. 261-266
  Electronic Edition (link) BibTeX
• C. Payan, Maurice Tchuente, N. H. Xuong:
  Arbres avec un nombre maximum de sommets pendants. 267-273
  Electronic Edition (link) BibTeX
• Andrzej Proskurowski:
  Separating subgraphs in k-trees: Cables and caterpillars. 275-285
  Electronic Edition (link) BibTeX
• Andrzej Rucinski:
  The behaviour of (k, ..., kⁿ, n-ik)c^i/i! is asymptotically normal. 287-290
  Electronic Edition (link) BibTeX
• György Turán:
  On the definability of properties of finite graphs. 291-302
  Electronic Edition (link) BibTeX
• J. M. Wills:
  Finite platonic graphs. 303-308
  Electronic Edition (link) BibTeX
• J. Csima:
  Colouring finite planes of odd order. 309
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  On the sphericity for the join of many graphs. 311-313
  Electronic Edition (link) BibTeX
• Ján Plesník:
  Equivalence between the minimum covering problem and the maximum matching problem. 315-317
  Electronic Edition (link) BibTeX
• Doron Zeilberger:
  A combinatorial proof of Newton's identities. 319
  Electronic Edition (link) BibTeX
• Noga Alon:
  A note on subdigraphs of digraphs with large outdegrees. 321-322
  Electronic Edition (link) BibTeX
• Françoise Garoche, Michel Leonard:
  On a class of boolean functions with matroid property. 323-325
  Electronic Edition (link) BibTeX
• G. W. Peck:
  A new proof of a theorem of Graham and Pollak. 327-328
  Electronic Edition (link) BibTeX