Discrete Mathematics, Volume 44

Volume 44, Number 1, 1983

• Ron Aharoni: A principle of symmetry in networks. 1-11 BibTeX
• Ronald D. Baker:
  Resolvable bibd and sols. 13-29
  Electronic Edition (link) BibTeX
• Edward A. Bertram:
  Some applications of graph theory to finite groups. 31-43
  Electronic Edition (link) BibTeX
• Mark A. Buckingham, Martin Charles Golumbic:
  Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. 45-54
  Electronic Edition (link) BibTeX
• James G. Oxley: On a matroid identity. 55-60 BibTeX
• Dinesh P. Rajkundlia:
  Some techniques for constructing infinite families of BIBD'S. 61-96
  Electronic Edition (link) BibTeX
• James E. Simpson:
  Langford sequences: perfect and hooked. 97-104
  Electronic Edition (link) BibTeX
• Henk Jan Veldman:
  Non-kappa-critical vertices in graphs. 105-110
  Electronic Edition (link) BibTeX
• Mao-cheng Cai:
  A counterexample to a conjecture of grant. 111
  Electronic Edition (link) BibTeX
• Alexander K. Kelmans, B. N. Kimelfeld:
  Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications. 113-116
  Electronic Edition (link) BibTeX
• Masako Sato: Note on the number of minimal lattice paths restricted by two parallel lines. 117-121 BibTeX

Volume 44, Number 2, 1983

• Richard P. Anstee: The network flows approach for matrices with given row and column sums. 125-138 BibTeX
• Robert C. Brigham, Ronald D. Dutton:
  On clique covers and independence numbers of graphs. 139-144
  Electronic Edition (link) BibTeX
• Jeffrey H. Dinitz, Douglas R. Stinson:
  Mols with holes. 145-154
  Electronic Edition (link) BibTeX
• Mario Gionfriddo:
  On the set J(v) for Steiner Quadruple systems of order v = 2ⁿ with n>=4. 155-160
  Electronic Edition (link) BibTeX
• Seiya Negami:
  Uniqueness and faithfulness of embedding of toroidal graphs. 161-180
  Electronic Edition (link) BibTeX
• J. R. Tort:
  Un probleme de partition de l'ensemble des parties a trois elements d'un ensemble fini. 181-185
  Electronic Edition (link) BibTeX
• Alan Tucker: Uniquely colorable perfect graphs. 187-194 BibTeX
• Yoko Usami:
  Minimum number of edges in graphs that are both P₂- and P_i-connected. 195-199
  Electronic Edition (link) BibTeX
• Peter R. Wild:
  Incidence graphs and subdesigns of semisymmetric designs. 201-216
  Electronic Edition (link) BibTeX
• J. A. Bondy, P. Hell:
  Counterexamples to theorems of Menger type for the diameter. 217-220
  Electronic Edition (link) BibTeX
• Mauro Cerasoli:
  On the probability of a Boolean polynomial of events. 221-227
  Electronic Edition (link) BibTeX
• Charles Payan:
  Perfectness and dilworth number. 229-230
  Electronic Edition (link) BibTeX

Volume 44, Number 3, 1983

• David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
  Sequentially additive graphs. 235-241
  Electronic Edition (link) BibTeX
• C. C. Chen, P. Manalastas:
  Every finite strongly connected digraph of stability 2 has a Hamiltonian path. 243-250
  Electronic Edition (link) BibTeX
• Ales Drápal:
  On quasigroups rich in associative triples. 251-265
  Electronic Edition (link) BibTeX
• E. J. Farrell:
  Forest decompositions of ladders. 267-274
  Electronic Edition (link) BibTeX
• Herbert Fleischner:
  Even cycles with prescribed chords in planar cubic graphs. 275-280
  Electronic Edition (link) BibTeX
• Gena Hahn, Dominique Sotteau, H. Sun:
  Short cycles in mediate graphs. 281-284
  Electronic Edition (link) BibTeX
• C. J. Liu, Yutze Chow:
  An operator approach to some graph enumeration problems. 285-291
  Electronic Edition (link) BibTeX
• Bruce E. Sagan:
  A note on Abel polynomials and rooted labeled forests. 293-298
  Electronic Edition (link) BibTeX
• M. G. Stone, R. H. Weedmark:
  On representing M_n's by congruence lattice of finite algebras. 299-308
  Electronic Edition (link) BibTeX
• Henk Jan Veldman:
  Existence of D_lambda-cycles and D_lambda-paths. 309-316
  Electronic Edition (link) BibTeX
• Geoffrey Exoo:
  On line disjoint paths of bounded length. 317-318
  Electronic Edition (link) BibTeX
• Jerald A. Kabell:
  A note on colorings of finite planes. 319-320
  Electronic Edition (link) BibTeX
• Fred R. McMorris, G. T. Myers:
  Some uniqueness results for upper bound. 321-323
  Electronic Edition (link) BibTeX
• Doron Zeilberger:
  Andre's reflection proof generalized to the many-candidate ballot problem. 325-326
  Electronic Edition (link) BibTeX
• P. J. Owens:
  Bipartite cubic graphs and a shortness exponent. 327-330
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel:
  Problem 38. 331-333
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel:
  Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. 333
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel:
  Problem 40. 333-334
  Electronic Edition (link) BibTeX