Discrete Mathematics, Volume 87

Volume 87, Number 1, January 1991

• Michael H. Albert, Alan M. Frieze:
  Occupancy problems and random algebras. 1-8
  Electronic Edition (link) BibTeX
• Maria Rita Casali, Luigi Grasselli:
  2-Symmetric crystallizations and 2-fold branched coverings of S³. 9-22
  Electronic Edition (link) BibTeX
• Ding-Zhu Du, D. Frank Hsu:
  Partitionable starters for twin prime power type. 23-28
  Electronic Edition (link) BibTeX
• F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman:
  Label-connected graphs and the gossip problem. 29-40
  Electronic Edition (link) BibTeX
• Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv:
  On grid intersection graphs. 41-52
  Electronic Edition (link) BibTeX
• Felix Lazebnik:
  Some corollaries of a theorem of Whitney on the chromatic polynomial. 53-64
  Electronic Edition (link) BibTeX
• Laura A. Sanchis:
  Maximum number of edges in connected graphs with a given domination number. 65-72
  Electronic Edition (link) BibTeX
• Sze-Chin Shee:
  Some results on lambda-valuation of graphs involving complete bipartite graphs. 73-80
  Electronic Edition (link) BibTeX
• Endre Boros:
  On shift stable hypergraphs. 81-84
  Electronic Edition (link) BibTeX
• Gustav Burosch, Jean-Marie Laborde:
  Characterization of grid graphs. 85-88
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  Several 2-(46, 6, 3) designs. 89-90
  Electronic Edition (link) BibTeX
• Sheshayya A. Choudum:
  On graphic and 3-hypergraphic sequences. 91-95
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  The intersection graph of random sets. 97-104
  Electronic Edition (link) BibTeX
• Balázs Montágh:
  A simple proof and a generalization of an old result of Chung and Feller. 105-108
  Electronic Edition (link) BibTeX

Volume 87, Number 2, January 1991

• Denise Amar, André Raspaud:
  Covering the vertices of a digraph by cycles of prescribed length. 111-118
  Electronic Edition (link) BibTeX
• Béla Bollobás, H. R. Hind:
  Graphs without large triangle free subgraphs. 119-131
  Electronic Edition (link) BibTeX
• Jacques Désarménien, Dominique Foata:
  Statistiques d'ordre sur les permutations colorées. 133-148
  Electronic Edition (link) BibTeX
• Tom Greene:
  Descriptively sufficient subcollections of flats in matroids. 149-161
  Electronic Edition (link) BibTeX
• Wei-Ping Liu, Ivan Rival:
  Inversions, cuts, and orientations. 163-174
  Electronic Edition (link) BibTeX
• Martin Skoviera:
  The maximum genus of graphs of diameter two. 175-180
  Electronic Edition (link) BibTeX
• Guo-Zhen Xiao, Ba-Zhong Shen, Chuan-Kun Wu, Chi Song Wong:
  Some spectral techniques in coding theory. 181-186
  Electronic Edition (link) BibTeX
• Mieko Yamada:
  Hadamard matrices of generalized quaternion type. 187-196
  Electronic Edition (link) BibTeX
• Yongjin Zhu, Feng Tian, Xiaotie Deng:
  More powerful closure operations on graphs. 197-214
  Electronic Edition (link) BibTeX
• Olof Heden:
  No partial 1-spread of class [0, >=2]_d in PG(2d-1, q) exists. 215-216
  Electronic Edition (link) BibTeX
• Liang Sun:
  On a problem of J. Csima. 217-218
  Electronic Edition (link) BibTeX

Volume 87, Number 3, February 1991

• B. A. Anderson:
  A product theorem for 2-sequencings. 221-236
  Electronic Edition (link) BibTeX
• Phyllis Z. Chinn, R. Bruce Richter, Miroslaw Truszczynski:
  Primal graphs with small degrees. 237-248
  Electronic Edition (link) BibTeX
• James D. Currie:
  Which graphs allow infinite nonrepetitive walks? 249-260
  Electronic Edition (link) BibTeX
• Paul Erdös, Fred Galvin:
  Some Ramsey-type theorems. 261-269
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez, Victor Neumann-Lara:
  Orientations of graphs in kernel theory. 271-280
  Electronic Edition (link) BibTeX
• Katherine Heinrich, Lisheng Wu, Lie Zhu:
  Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist for all m. 281-290
  Electronic Edition (link) BibTeX
• Germain Kreweras, Paul Moszkowski:
  Tree codes that preserve increases and degree sequences. 291-296
  Electronic Edition (link) BibTeX
• J. C. Parnami:
  The iteration of a bijective transformation of integer k-tuples mod m. 297-307
  Electronic Edition (link) BibTeX
• Miroslaw Truszczynski, Zsolt Tuza:
  Asymptotic results on saturated graphs. 309-314
  Electronic Edition (link) BibTeX
• Melvin F. Janowitz:
  A converse to the Sholander embedding. 315-318
  Electronic Edition (link) BibTeX
• Louis W. Shapiro:
  Voting blocks, reluctant functions, and a formula of Hurwitz. 318-322
  Electronic Edition (link) BibTeX
• Gerhard J. M. van Wee:
  On the non-existence of certain perfect mixed codes. 323-326
  Electronic Edition (link) BibTeX