Discrete Mathematics, Volume 37

Volume 37, Number 1, 1981

B. A. Anderson, P. A. Leonard:
Some Howell Designs of prime side II. 1-18
Jacques Aubert, Bernadette Schneider:
Decomposition de K_m+K_n en cycles hamiltoniens. 19-27
Agnes Hui Chan:
Embedding of a pseudo-point residual design into a Möbius plane. 29-33
M. Chein, Michel Habib, M. C. Maurer:
Partitive hypergraphs. 35-50
Prabir Das:
Characterization of unigraphic and unidigraphic integer-pair sequences. 51-66
Hans-Dietrich O. F. Gronau:
Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I. 67-72
W. Mielants, G. Bruyneel:
Minimal balanced sets and finite geometries. 73-77
Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis:
On the existence of frames. 79-104
Takao Nishizeki:
On the maximum matchings of regular multigraphs. 105-114
Reine Fournier:
Note sur la decomposition de K_N₀. 115-117
George L. O'Brien:
A generalized notion of quotient for finite Abelian groups. 119-121
Peter Mihók:
On graphs critical with respect to vertex partition numbers. 123-126
Guy Pasquier:
Binary images of some self-dual codes over GF(2^m) with respect to trace-orthogonal basis. 127-129

H. L. Abbott, A. C. Liu:
On property B(s), II. 135-141
Jaromir Abrham, Anton Kotzig:
Skolem sequences and additive permutations. 143-146
Eiichi Bannai, Tatsuro Ito:
Regular graphs with excess one. 147-158
Bhagwandas, W. G. Bridges:
Applications of algebraic duality to group divisible structures. 159-166
Wayne M. Dymàcek:
Complements of Steinhaus graphs. 167-180
Wen-Lian Hsu, George L. Nemhauser:
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. 181-191
S. A. Joni, G.-C. Rota, Bruce E. Sagan:
From sets to functions: Three elementary examples. 193-202
A. Donald Keedwell:
On the sequenceability of non-abelian groups of order pq. 203-216
János Pach:
Graphs whose every independent set has a common neighbour. 217-228
L. J. Senechal:
Chain algebras. 229-244
H. M. Shefrin:
On the combinatorial structure of Bayesian learning with imperfect information. 245-254
Richard P. Stanley:
Factorization of permutations into n-cycles. 255-262
Ioan Tomescu:
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. 263-277
Hian Poh Yap:
On graphs whose maximal subgraphs have at most two orbits. 279-287
Hian Poh Yap:
On graphs critical with respect to edge-colourings. 289-296
Maciej M. Syslo:
The Helly-type property of non-trivial intervals on a tree. 297-298
Jean-Paul Doignon:
On characterizations of binary and graphic matroids. 299-301

Last update Wed May 22 17:28:01 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page