Discrete Mathematics, Volume 46

Volume 46, Number 1, 1983

• N. G. Bate:
  Complete graphs without polychromatic circuits. 1-8
  Electronic Edition (link) BibTeX
• Kenneth A. Berman:
  Proof of a conjecture of Häggkvist on cycles and independent edges. 9-13
  Electronic Edition (link) BibTeX
• Brad Jackson, Gerhard Ringel:
  Maps of m-pires on the projective plane. 15-20
  Electronic Edition (link) BibTeX
• S. Kounias, M. Lefkopoulou, C. Bagiatis:
  G-optimal N-observation first order 2^k designs. 21-31
  Electronic Edition (link) BibTeX
• Shinji Kuriki, Masakazu Jimbo:
  On 1-rotational S_lambda(2, 3, nu) designs. 33-40
  Electronic Edition (link) BibTeX
• Isabel Loureiro:
  Finitely generated free tetravalent modal algebras. 41-48
  Electronic Edition (link) BibTeX
• Dragan Marusic:
  Hamiltonian circuits in Cayley graphs. 49-54
  Electronic Edition (link) BibTeX
• Erich Durnberger:
  Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian groups are hamiltonian. 55-68
  Electronic Edition (link) BibTeX
• K. R. Parthasarathy, R. Nandakumar:
  Unique eccentric point graphs. 69-74
  Electronic Edition (link) BibTeX
• Ákos Seress:
  Gossiping old ladies. 75-81
  Electronic Edition (link) BibTeX
• James B. Shearer:
  A note on the independence number of triangle-free graphs. 83-87
  Electronic Edition (link) BibTeX
• François Jaeger:
  The 1-factorization of some line-graphs. 89-92
  Electronic Edition (link) BibTeX
• François Jaeger, Charles Payan, Mekkia Kouider:
  Partition of odd regular graphs into bistars. 93-94
  Electronic Edition (link) BibTeX
• William M. Kantor:
  Exponential numbers of two-weight codes, difference sets and symmetric designs. 95-98
  Electronic Edition (link) BibTeX
• Eugene Levine:
  On a harmonious graph conjecture. 99-101
  Electronic Edition (link) BibTeX
• A. Meir, J. W. Moon:
  On an asymptotic evaluation of the cycle index of the symmetric group. 103-105
  Electronic Edition (link) BibTeX
• Rodica Simion, Frank W. Schmidt:
  On (+1, -1)-matrices with vanishing permanent. 107-108
  Electronic Edition (link) BibTeX
• Wenceslas Fernandez de la Vega:
  On the maximum density of graphs which have no subcontraction to K³. 109-110
  Electronic Edition (link) BibTeX

Volume 46, Number 2, 1983

• J. L. Brenner, R. C. Lyndon:
  Infinite Eulerian tessellations. 111-132
  Electronic Edition (link) BibTeX
• Michael Capobianco, Ove Frank:
  Graph evolution by stochastic additions of points and lines. 133-143
  Electronic Edition (link) BibTeX
• Paul Erdös, Zbigniew Palka:
  Trees in random graphs. 145-150
  Electronic Edition (link) BibTeX
• Ralph J. Faudree, J. Sheehan:
  Size Ramsey numbers involving stars. 151-157
  Electronic Edition (link) BibTeX
• Claude Flament, Bruno Leclerc:
  Arbres minimaux d'un graphe preordonne. 159-171
  Electronic Edition (link) BibTeX
• Katherine Heinrich, Anthony J. W. Hilton:
  Doubly diagonal orthogonal latin squares. 173-182
  Electronic Edition (link) BibTeX
• Alexander K. Kelmans, M. V. Lomonosov:
  On cycles through prescribed vertices in weakly separable graphs. 183-189
  Electronic Edition (link) BibTeX
• Richard D. Ringeisen, Marc J. Lipman:
  Cohesion and stability in graphs. 191-198
  Electronic Edition (link) BibTeX
• Noga Alon:
  On the density of sets of vectors. 199-202
  Electronic Edition (link) BibTeX
• Béla Bollobás:
  Some remarks on packing trees. 203-204
  Electronic Edition (link) BibTeX
• Helmut Prodinger:
  A correspondence between ordered trees and noncrossing partitions. 205-206
  Electronic Edition (link) BibTeX
• Jules Varlet:
  Relative de Morgan lattices. 207-209
  Electronic Edition (link) BibTeX
• Andrew Vince:
  An algebraic theory of graph factorization. 211-213
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel:
  Problem 47 : Posed by Aviezri S. Fraenkel. 215-216
  Electronic Edition (link) BibTeX
• G. L. Sicherman:
  Problem 48. 216
  Electronic Edition (link) BibTeX

Volume 46, Number 3, 1983

• Dominique Buset:
  Graphs which are locally a cube. 221-226
  Electronic Edition (link) BibTeX
• Leo G. Chouinard, Earl S. Kramer, Donald L. Kreher:
  Graphical t-wise balanced designs. 227-240
  Electronic Edition (link) BibTeX
• Mihály Geréb-Graus:
  An external theorem on divisors of a number. 241-248
  Electronic Edition (link) BibTeX
• Masakazu Jimbo, Shinji Kuriki:
  On a composition of cyclic 2-designs. 249-255
  Electronic Edition (link) BibTeX
• Jean François Maurras:
  Convex hull of the edges of a graph and near bipartite graphs. 257-265
  Electronic Edition (link) BibTeX
• Bernard Péroche:
  On several sorts of connectivity. 267-277
  Electronic Edition (link) BibTeX
• S. Ramachandran:
  N-reconstructibility of non-reconstructible digraphs. 279-294
  Electronic Edition (link) BibTeX
• Ratko Tosic:
  Two counterfeit coins. 295-298
  Electronic Edition (link) BibTeX
• Sue Whitesides:
  Edge-colored complete graphs with alternating cycles. 299-304
  Electronic Edition (link) BibTeX
• Dragic Bankovic:
  Solving systems of arbitrary equations. 305-309
  Electronic Edition (link) BibTeX
• Chong-Yun Chao, Jacqueline G. Wells:
  On labeled vertex-transitive digraphs with a prime number of vertices. 311-315
  Electronic Edition (link) BibTeX
• Derek G. Corneil, J. Mark Keil:
  A note on a conjecture by Gavril on clique separable graphs. 317-318
  Electronic Edition (link) BibTeX
• Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel:
  Representing a planar graph by vertical lines joining different levels. 319-321
  Electronic Edition (link) BibTeX
• Frank K. Hwang, Victor K.-W. Wei:
  A partition identity. 323-326
  Electronic Edition (link) BibTeX
• Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa:
  Hamiltonian pancyclic graphs. 327
  Electronic Edition (link) BibTeX