Discrete Mathematics, Volume 39

Volume 39, Number 1, 1982

Thomas Andreae:
Reconstructing the degree sequence and the number of components of an infinite graph. 1-7
Electronic Edition (link) BibTeX
Elizabeth J. Billington:
More balanced ternary designs with block size three. 9-21
Electronic Edition (link) BibTeX
Robert A. Chaffer:
A construction of orthogonal arrays and applications to embedding theorems. 23-29
Electronic Edition (link) BibTeX
E. J. Farrell:
A note on the circuit polynomials and characteristic polynomials of wheels and ladders. 31-36
Electronic Edition (link) BibTeX
Hai-Ping Ko, Dijen K. Ray-Chaudhuri:
Intersection theorems for group divisible difference sets. 37-58
Electronic Edition (link) BibTeX
Jenö Lehel, Zsolt Tuza:
Triangle-free partial graphs and edge covering theorems. 59-65
Electronic Edition (link) BibTeX
Pavel Pudlák, Vojtech Rödl:
Partition theorems for systems of finite subsets of integers. 67-73
Electronic Edition (link) BibTeX
David B. Skillicorn:
More generalized packing numbers. 75-86
Electronic Edition (link) BibTeX
William T. Trotter, Ted R. Monroe:
A combinatorial problem involving graphs and matrices. 87-101
Electronic Edition (link) BibTeX
András Frank:
A note on k-strongly connected orientations of an undirected graph. 103-104
Electronic Edition (link) BibTeX
Peter Hammond:
On the non-existence of perfect and nearly perfect codes. 105-109
Electronic Edition (link) BibTeX

Emden R. Gansner:
On the lattice of order ideals of an up-down poset. 113-122
Electronic Edition (link) BibTeX
Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu:
Boolean distance for graphs. 123-127
Electronic Edition (link) BibTeX
F. T. Howard:
A theorem relating potential and bell polynomials. 129-143
Electronic Edition (link) BibTeX
F. K. Hwang:
Complete balanced Howell rotations for 8k+5 teams. 145-151
Electronic Edition (link) BibTeX
Graham Kelly:
On the uniqueness of embedding a residual design. 153-160
Electronic Edition (link) BibTeX
Jean-Marie Laborde, Surya Prakash Rao Hebbare:
Another characterization of hypercubes. 161-166
Electronic Edition (link) BibTeX
Russell Merris:
Majorization of characters of the symmetric group. 167-169
Electronic Edition (link) BibTeX
Masakazu Nasu:
Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs. 171-197
Electronic Edition (link) BibTeX
P. J. Owens:
Shortness parameters of families of regular planar graphs with two or three types of face. 199-209
Electronic Edition (link) BibTeX
Maurice Tchuente:
Parallel realization of permutations over trees. 211-214
Electronic Edition (link) BibTeX
Thomas Zaslavsky:
Signed graph coloring. 215-228
Electronic Edition (link) BibTeX
Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien:
A catalogue of small maximal nonhamiltonian graphs. 229-234
Electronic Edition (link) BibTeX

Lowell W. Beineke, Christina Zamfirescu:
Connection digraphs and second-order line digraphs. 237-254
Electronic Edition (link) BibTeX
Luigi Borzacchini, Carmelo Pulito:
Some results on conversion matrices. 255-261
Electronic Edition (link) BibTeX
Andries E. Brouwer, G. H. John van Rees:
More mutually orthogonal latin squares. 263-281
Electronic Edition (link) BibTeX
Immo Diener:
On S-cyclic steiner systems. 283-292
Electronic Edition (link) BibTeX
Alan Hartman:
Quadruple systems containing AG(3, 2). 293-299
Electronic Edition (link) BibTeX
Wan-Di Wei:
The class A(R, S) of (0, 1)-matrices. 301-305
Electronic Edition (link) BibTeX
Douglas B. West:
A class of solutions to the gossip problem, part I. 307-326
Electronic Edition (link) BibTeX
H. L. Abbott, A. Liu:
Remarks on a paper of Hirschfeld concerning Ramsey numbers. 327-328
Electronic Edition (link) BibTeX
Mao-cheng Cai:
A new bound on the length of the shortest string containing all r-permutations. 329-330
Electronic Edition (link) BibTeX
G. Hansel:
Baionnettes et cardinaux. 331-335
Electronic Edition (link) BibTeX
P. Winkler:
Average height in a partially ordered set. 337-341
Electronic Edition (link) BibTeX