default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete 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 - Elizabeth J. Billington:
More balanced ternary designs with block size three. 9-21 - Robert A. Chaffer:
A construction of orthogonal arrays and applications to embedding theorems. 23-29 - Edward J. Farrell:
A note on the circuit polynomials and characteristic polynomials of wheels and ladders. 31-36 - Hai-Ping Ko, Dijen K. Ray-Chaudhuri:
Intersection theorems for group divisible difference sets. 37-58 - Jenö Lehel, Zsolt Tuza:
Triangle-free partial graphs and edge covering theorems. 59-65 - Pavel Pudlák, Vojtech Rödl:
Partition theorems for systems of finite subsets of integers. 67-73 - David B. Skillicorn
:
More generalized packing numbers. 75-86 - William T. Trotter, Ted R. Monroe:
A combinatorial problem involving graphs and matrices. 87-101 - András Frank:
A note on k-strongly connected orientations of an undirected graph. 103-104 - Peter Hammond:
On the non-existence of perfect and nearly perfect codes. 105-109
Volume 39, Number 2, 1982
- Emden R. Gansner:
On the lattice of order ideals of an up-down poset. 113-122 - Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu:
Boolean distance for graphs. 123-127 - F. T. Howard:
A theorem relating potential and bell polynomials. 129-143 - Frank K. Hwang:
Complete balanced Howell rotations for 8k+5 teams. 145-151 - Graham Kelly:
On the uniqueness of embedding a residual design. 153-160 - Jean-Marie Laborde, Surya Prakash Rao Hebbare:
Another characterization of hypercubes. 161-166 - Russell Merris:
Majorization of characters of the symmetric group. 167-169 - Masakazu Nasu:
Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs. 171-197 - P. J. Owens:
Shortness parameters of families of regular planar graphs with two or three types of face. 199-209 - Maurice Tchuenté:
Parallel realization of permutations over trees. 211-214 - Thomas Zaslavsky:
Signed graph coloring. 215-228 - Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien:
A catalogue of small maximal nonhamiltonian graphs. 229-234
Volume 39, Number 3, May 1982
- Lowell W. Beineke, Christina Zamfirescu:
Connection digraphs and second-order line digraphs. 237-254 - Luigi Borzacchini, Carmelo Pulito:
Some results on conversion matrices. 255-261 - Andries E. Brouwer, G. H. John van Rees:
More mutually orthogonal latin squares. 263-281 - Immo Diener:
On S-cyclic steiner systems. 283-292 - Alan Hartman:
Quadruple systems containing AG(3, 2). 293-299 - Wan-Di Wei:
The class A(R, S) of (0, 1)-matrices. 301-305 - Douglas B. West:
A class of solutions to the gossip problem, part I. 307-326 - H. L. Abbott, Andrew Chiang-Fung Liu:
Remarks on a paper of Hirschfeld concerning Ramsey numbers. 327-328 - Mao-cheng Cai:
A new bound on the length of the shortest string containing all r-permutations. 329-330 - Georges Hansel:
Baionnettes et cardinaux. 331-335 - Peter Winkler:
Average height in a partially ordered set. 337-341
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
