Discrete Mathematics, Volume 61

Volume 61, Number 1, August 1986

• Richard A. Brualdi, Ernie S. Solheid:
  Maximum determinants of complementary acyclic matrices of zeros and ones. 1-19
  
• Guy Chassé:
  Combinatorial cycles of a polynomial map over a commutative field. 21-26
  
• Ying Cheng:
  Switching classes of directed graphs and H-equivalent matrices. 27-40
  
• Jacqueline W. Daykin:
  Inequalities for the number of monotonic functions of partial orders. 41-55
  
• G. R. T. Hendry:
  The size of graphs uniquely hamiltonian-connected from a vertex. 57-60
  
• K. M. Koh, K. S. Poh:
  On the uniformity of the closed-set lattice of a tree. 61-70
  
• Winfried Kurth:
  Enumeration of platonic maps on the torus. 71-83
  
• Gregory F. Lawler:
  Expected hitting times for a random walk on a connected graph. 85-92
  
• Jenö Lehel, Zsolt Tuza:
  Neighborhood perfect graphs. 93-101
  
• Anne Delandtsheer:
  Transitivity on sets of independent points in geometric lattices. 103-105
  
• Robert Shelton, Konrad J. Heuvers, Daniel S. Moak, K. P. S. Bhaskara Rao:
  Multinomial matrices. 107-114
  
• R. Glenn Powers:
  The ith Ramsey number for matchings. 115-118
  

Volume 61, Numbers 2-3, September 1986

• A. M. Assaf:
  On the covering of pairs by quadruples. 119-132
  
• Gerhard Behrendt:
  Shaprly transitive partially ordered sets. 133-139
  
• J. Chvatalova, Jaroslav Opatrny:
  The bandwidth problem and operations on graphs. 141-150
  
• W. Edwin Clark:
  Cyclic codes over GF(q) with simple orbit structure. 151-164
  
• Peter C. Fishburn, Frank K. Hwang, Hikyu Lee:
  Do local majorities force a global majority? 165-179
  
• Harold Fredricksen, Irving J. Kessler:
  An algorithm for generating necklaces of beads in two colors. 181-188
  
• M. K. Gill, G. A. Patwardhan:
  Switching invariant two-path signed graphs. 189-196
  
• John L. Goldwasser:
  Permanent of the laplacian matrix of trees with a given matching. 197-212
  
• Wan Honghui, Li Qiao:
  On the number of tournaments with prescribed score vector. 213-219
  
• Masahide Kuwada, Shinji Kuriki:
  Some existence conditions for partially balanced arrays with 2 symbols. 221-233
  
• Hiroshi Maehara:
  Metric transforms of finite spaces and connected graphs. 235-246
  
• Frédéric Maffray:
  On kernels in i-triangulated graphs. 247-251
  
• Zbigniew Palka, Andrzej Rucinski, Joel Spencer:
  On a method for random graphs. 253-258
  
• M. Preissmann, Dominique de Werra, Nadimpalli V. R. Mahadev:
  A note on superbrittle graphs. 259-267
  
• Rolf S. Rees:
  Minimal clique partitions and pairwise balanced designs. 269-280
  
• Martin Skoviera:
  A contribution to the theory of voltage graphs. 281-292
  
• Peter J. Slater:
  On k-graceful, countably infinite graphs. 293-303
  
• Douglas R. Stinson:
  Concerning the spectrum of perpendicular arrays of triple systems. 305-310
  
• Paul Terwilliger:
  A new feasibility condition for distance-regular graphs. 311-315
  
• Anne Delandtsheer:
  Orbits in uniform hypergraphs. 317-319
  
• Hans-Dietrich O. F. Gronau, Roger Labahn:
  An extremal coloring problem on matrices. 321-324
  
• Arie Bialostocki:
  An application of the Ramsey theorem to ordered r-tournaments. 325-328
  
• W. Bienia, Henry Meyniel:
  Partitions of digraphs into paths or circuits. 329-331
  
• Peter Gerl:
  Natural spanning trees of Z^d are recurrent. 333-336
  
• K. V. Menon:
  Note on some determinants of q-binomial numbers. 337-341