default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 5
Volume 5, Number 1, March 1984
- Lucien Bénéteau:
The Hall Triple Systems of Small Class. 1-5 - Anders Björner:
Posets, Regular CW Complexes and Bruhat Order. 7-16 - Victor Bryant:
Extending Latin Rectangles with Restraints. 17-21 - Rudolf Halin:
On the Representation of Triangulated Graphs in Trees. 23-28 - Stuart G. Hoggar:
Parameters of t-Designs in 𝔽Pd-1. 29-36 - Noboru Ito:
Hadamard Tournaments with Transitive Automorphism Groups. 37-42 - Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups. 43-50 - A. M. Khidr, B. S. El-Desouky:
A Symmetric Sum Involving the Stirling Numbers of the First Kind. 51-54 - Bernt Lindström:
On Binary Identically Self-dual Matroids. 55-58 - Mark A. Ronan, Gernot Stroth:
Minimal Parabolic Geometries for the Sporadic Groups. 59-91
Volume 5, Number 2, June 1984
- Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley:
A Note on the Critical Problem for Matroids. 93-97 - Patrice Assouad:
Sur les Inégalités Valides dans L1. 99-112 - Albrecht Beutelspacher, Jörg Meinhardt:
On Finite h-Semiaffine Planes. 113-122 - Norman E. Fenton
:
Matroid Representation of Projective Spaces. 123-126 - Peter Frankl, Zoltán Füredi:
Union-free Hypergraphs and Probability Theory. 127-131 - Zoltán Füredi:
Geometrical Solution of an Intersection Problem for Two Hypergraphs. 133-136 - Thomas Ihringer:
On Multiplication Groups of Quasigroups. 137-141 - Dieter Jungnickel, Klaus Vedder:
On the Geometry of Planar Difference Sets. 143-148 - Heinz Adolf Jung, Mark E. Watkins:
Fragments and Automorphisms of Infinite Graphs. 149-162 - Peter J. Lorimer:
Trivalent Symmetric Graphs of Order at most 120. 163-171 - Vassili C. Mavron, Shoaib Ud Din:
On the Existence of Certain Symmetric Affine Resolvable Designs. 173-183 - Zsolt Tuza:
Helly-type Hypergraphs and Sperner Families. 185-187
Volume 5, Number 3, September 1984
- Richard Askey, Amitai Regev:
Maximal Degrees for Young Diagrams in a Strip. 189-191 - Lucien Bénéteau:
3-Abelian Groups and Commutative Moufang Loops. 193-196 - Kenneth A. Berman:
A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean. 197-205 - Michael Clausen:
Dominance Orders, Capelli Operators, and Straightening of Bideterminants. 207-222 - Hubert de Fraysseix:
A Characterization of Circle Graphs. 223-238 - Kevin T. Phelps, Charles C. Lindner:
On the Number of Mendelsohn and Transitive Triple Systems. 239-242 - Alain Quilliot:
Un Problème de Connectivité sur les Espaces Métriques. 243-253 - François Zara:
Graphes Lies aux Espaces Polaires. 255-290
Volume 5, Number 4, December 1984
- Louis J. Billera, Beth Spellman Munson:
Polarity and Inner Products in Oriented Matroids. 293-308 - Yahya Ould Hamidoune:
On the Connectivity of Cayley Digraphs. 309-312 - Tamás Lengyel:
On a Recurrence involving Stirling Numbers. 313-321 - Nicola Melone, Domenico Olanda:
A Characteristic Property of the Grassmann Manifold Representing the Lines of a Projective Space. 323-330 - Robert A. Proctor:
Bruhat Lattices, Plane Partition Generating Functions, and Minuscule Representations. 331-350 - Helmut Prodinger:
The Average Height of the Second Highest Leaf of a Planted Plane Tree. 351-357 - Richard P. Stanley:
On the Number of Reduced Decompositions of Elements of Coxeter Groups. 359-372 - Volker Strehl:
Two Short Proofs of Kemp's Identity for Rooted Plane Trees. 373-376 - Klaus Truemper:
Partial Matroid Representations. 377-394
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 2024-11-22 19:45 CET 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:
