![](https://dblp.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
European Journal of Combinatorics, Volume 1
Volume 1, Number 1, March 1980
- Éditorial. 1-3
- Lars Døvling Andersen, Roland Häggkvist, Anthony J. W. Hilton, William B. Poucher:
Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed. 5-7 - Krishna B. Athreya, C. R. Pranesachar, Navin M. Singhi:
On the Number of Latin Rectangles and Chromatic Polynomial of L(Kr, s). 9-17 - Eiichi Bannai:
On the Weight Distribution of Spherical t-designs. 19-26 - Anders Björner:
The Minimum Number of Faces of a Simple Polyhedron. 27-31 - Andrea Brini:
A Class of Rank-invariants for Perfect Matroid Designs. 33-38 - Andries E. Brouwer:
A Series of Separable Designs with Application to Pairwise Orthogonal Latin Squares. 39-41 - Paul Erdös:
Some Applications of Ramsey's Theorem to Additive Number Theory. 43-46 - Adriano M. Garsia, Jeffrey B. Remmel:
A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers. 47-59 - Bernt Lindström:
A Partition of L(3, n) into Saturated Symmetric Chains. 61-63 - László Lovász:
Matroids and Sperner's Lemma. 65-66 - Gian-Carlo Rota, Bruce E. Sagan:
Congruences Derived from Group Action. 67-76 - William T. Tutte:
1-Factors and Polynomials. 77-87
Volume 1, Number 2, June 1980
- Peter J. Cameron
:
On Graphs with Given Automorphism Group. 91-96 - Michel Dehon:
Ranks of Incidence Matrices of t-designs Sλ(t, t+1, v). 97-100 - Peter Frankl:
Extremal Problems and Coverings of the Space. 101-106 - Ronald L. Graham:
On a Diophantine Equation Arising in Graph Theory. 107-112 - Gilbert Labelle:
Sur l'Inversion et l'Iteration Continue des Séries Formelles. 113-138 - Nicholas C. Metropolis, P. R. Stein:
The Enumeration of Graphical Partitions. 139-153 - W. Mielants:
Remark on the Generalized Graph Extension Theorem. 155-161 - Arnold Neumaier
:
Distances, Graphs and Designs. 163-174 - Richard P. Stanley:
Differentiably Finite Power Series. 175-188 - Joseph A. Thas:
Construction of Maximal Arcs and Dual Ovals in Translation Planes. 189-192
Volume 1, Number 3, September 1980
- Béla Bollobás, Paul A. Catlin, Paul Erdös:
Hadwiger's Conjecture is True for Almost Every Graph. 195-199 - Raul Cordovil:
Representation over a Field of Full Simplicial Matroids. 201-205 - József Dénes:
Research Problems. 207-209 - Friedrich Esser, Frank Harary:
On the Spectrum of a Complete Multipartite Graph. 211-218 - Ryoh Fuji-Hara, Scott A. Vanstone:
Transversal Designs and Doubly-resolvable Designs. 219-223 - Jerrold R. Griggs:
The Littlewood-Offord Problem: Tightest Packing and an M-part Sperner Theorem. 225-234 - Gena Hahn:
The Automorphism Group of the Wreath Product of Directed Graphs. 235-241 - Mark Jungerman, Arthur T. White:
On the Genus of Finite Abelian Groups. 243-251 - Kevin T. Phelps, Alexander Rosa:
2-Chromatic Steiner Quadruple Systems. 253-258 - Mark A. Ronan:
Coverings and Automorphisms of Chamber Systems. 259-269 - Richard Weiss:
A Geometric Characterization of Certain Groups of Lie Type. 271-282
Volume 1, Number 4, December 1980
- George E. Andrews, Dominique Foata:
Congruences for the q-secant Numbers. 283-287 - Eiichi Bannai, Etsuko Bannai:
How many P-polynomial Structures can an Association Scheme have? 289-298 - Lucien Bénéteau, Jacqueline Lacaze:
Groupes d'Automorphismes des Boucles de Moufang Commutatives. 299-309 - Béla Bollobás:
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs. 311-316 - Raul Cordovil:
Sur L'Évaluation t(M; 2, 0) du Polynôme de Tutte d'un Matroïde et une Conjecture de B. Grünbaum Relative aux Arrangements de Droites du Plan. 317-322 - Frank De Clerck, R. H. Dye, Joseph A. Thas:
An Infinite Class of Partial Geometries Associated with the Hyperbolic Quadric in PG(4n - 1, 2). 323-326 - R. De Groote, James W. P. Hirschfeld:
The Number of Points on an Elliptic Cubic Curve over a Finite Field. 327-333 - Paul H. Edelman
:
Zeta Polynomials and the Möbius Function. 335-340 - Péter L. Erdös, Zoltán Füredi:
On Automorphisms of Line-graphs. 341-345 - Christiane Lefèvre-Percsy:
Characterizations of Designs Constructed from Affine and Projective Spaces. 347-352 - Heinrich Niederhausen:
Linear Recurrences Under Side Conditions. 353-368 - Guy Pasquier:
The Binary GOLAY Code Obtained from an Extended Cyclic Code over 𝔽8. 369-370 - Carsten Thomassen:
2-Linked Graphs. 371-378 - Douglas B. West:
A Symmetric Chain Decomposition of L(4, n). 379-383
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.