Discrete Mathematics, Volume 34

Volume 34, Number 1, 1981

• Robert C. Brigham, Ronald D. Dutton:
  Graphs which, with their complements, have certain clique covering numbers. 1-7
  Electronic Edition (link) BibTeX
• William H. Burge:
  A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities. 9-15
  Electronic Edition (link) BibTeX
• Lowell A. Carmony, Soon Teck Tan:
  S-Quasi-symmetry. 17-24
  Electronic Edition (link) BibTeX
• S. Gallivan, E. R. Lockeberg, P. McMullen:
  Complete subgraphs of the graphs of convex polytopes. 25-29
  Electronic Edition (link) BibTeX
• Mario Gionfriddo, C. C. Lindler:
  Construction of steiner quadruple systems having a prescribed number of blocks in common. 31-42
  Electronic Edition (link) BibTeX
• Martin Grötschel, Yoshiko Wakabayashi:
  On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. 43-59
  Electronic Edition (link) BibTeX
• Cornelis Hoede, Henk Jan Veldman:
  Contraction theorems in Hamiltonian graph theory. 61-67
  Electronic Edition (link) BibTeX
• Paul M. B. Vitányi:
  How well can a graph be n-colored? 69-80
  Electronic Edition (link) BibTeX
• Charalambos A. Charalambides:
  Bipartitional polynomials and their applications in combinatorics and statistics. 81-84
  Electronic Edition (link) BibTeX
• B. L. Misra, M. L. Chandak:
  Construction of symmetric PBIB designs and related results. 85-87
  Electronic Edition (link) BibTeX
• Doron Zeilberger:
  Enumeration of words by their number of mistakes. 89-91
  Electronic Edition (link) BibTeX
• Mitsuo Yoshizawa:
  Remarks on distance-regular graphs. 93-94
  Electronic Edition (link) BibTeX
• L. Zhu:
  Affinely totally variant subsets of V₃(GF(3)). 95-99
  Electronic Edition (link) BibTeX

Volume 34, Number 2, 1981

• Erminia D'Agostini:
  On caps with weighted points in PG(t, q). 103-110
  Electronic Edition (link) BibTeX
• Ronald J. Gould:
  On line graphs and the hamiltonian index. 111-117
  Electronic Edition (link) BibTeX
• Hans-Dietrich O. F. Gronau:
  On maximal families of subsets of a finite set. 119-130
  Electronic Edition (link) BibTeX
• Gena Hahn:
  More star sub-ramsey numbers. 131-139
  Electronic Edition (link) BibTeX
• Andreas Kriegl:
  A characterization of reduced incidence algebras. 141-144
  Electronic Edition (link) BibTeX
• Malaz Maamoun:
  Parité des cycles contenant des sommets specifiés d'un graphe. 145-152
  Electronic Edition (link) BibTeX
• Yehoshua Perl, Shmuel Zaks:
  Deficient generalized Fibonacci maximum path graphs. 153-164
  Electronic Edition (link) BibTeX
• Svatopluk Poljak, Ales Pultr:
  On the dimension of trees. 165-171
  Electronic Edition (link) BibTeX
• Svatopluk Poljak, Vojtech Rödl:
  On set systems determined by intersections. 173-184
  Electronic Edition (link) BibTeX
• Peter J. Slater:
  On k-sequential and other numbered graphs. 185-193
  Electronic Edition (link) BibTeX
• Pavel Tomasta:
  "Dart calculus" of induced subsets. 195-198
  Electronic Edition (link) BibTeX
• Brian Alspach, Moshe Rosenfeld:
  Realization of certain generalized paths in tournaments. 199-202
  Electronic Edition (link) BibTeX
• Louis W. Shapiro:
  A combinatorial proof of a Chevyshev polynomial identity. 203-206
  Electronic Edition (link) BibTeX

Volume 34, Number 3, 1981

• Jin Akiyama, Hiroshi Era, Geoffrey Exoo:
  Further results on graph equations for line graphs and n-th power graphs. 209-218
  Electronic Edition (link) BibTeX
• Gerald L. Alexanderson, John E. Wetzel:
  Arrangements of planes in space. 219-240
  Electronic Edition (link) BibTeX
• Andries E. Brouwer, Robert Tijdeman:
  On the edge-colouring problem for unions of complete uniform hypergraphs. 241-260
  Electronic Edition (link) BibTeX
• D. J. Hartfiel, Carlton J. Maxson:
  The construction and decomposition of patterns induced by a positive cone of functions. 261-274
  Electronic Edition (link) BibTeX
• E. Marques De Sá:
  Note on graphs and weakly cyclic matrices. 275-281
  Electronic Edition (link) BibTeX
• Denis Naddef, William R. Pulleyblank:
  Matchings in regular graphs. 283-291
  Electronic Edition (link) BibTeX
• Nicolae Tandareanu:
  On generalized Boolean functions i. 293-299
  Electronic Edition (link) BibTeX
• Barbara Turner, Ken Warner:
  The structure and geometry of 4×4 pandiagonal matrices. 301-310
  Electronic Edition (link) BibTeX
• Peter Frankl, Zoltán Füredi:
  A short proof for a theorem of Harper about Hamming-spheres. 311-313
  Electronic Edition (link) BibTeX
• T. A. McKee:
  A quantifier for matroid duality. 315-318
  Electronic Edition (link) BibTeX
• Heinrich Müller:
  Oriented hypergraphs, stability numbers and chromatic numbers. 319-320
  Electronic Edition (link) BibTeX
• Jean-Pierre Barthélemy:
  About the shortest chain between two vertices in a quasi strongly connected digraph with a potential. 321-324
  Electronic Edition (link) BibTeX
• M. Boshernitzan, Aviezri S. Fraenkel:
  Nonhomogeneous spectra of numbers. 325-327
  Electronic Edition (link) BibTeX