default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 52
Volume 52, Number 1, 1984
- Lynn Margaret Batten:
Embedding the complement of a minimal blocking set in a projective plane. 1-5 - Joel Berman, Ralph McKenzie:
Clones satisfying the term condition. 7-21 - Robert C. Brigham, Ronald D. Dutton:
Upper bounds on the edge clique cover number of a graph. 31-37 - Mark Broadie, Richard W. Cottle:
A note on triangulating the 5-cube. 39-49 - Gary Gordon:
Matroids over fp which are rational excluded minors. 51-65 - Charles C. Lindner, Douglas R. Stinson:
Steiner pentagon systems. 67-74 - Siu Lun Ma:
Partial difference sets. 75-89 - Madeleine Paoli:
Powers of connected graphs and hamiltonicity. 91-99 - Volker Prüb:
A characterization of matroidal families of multigraphs. 101-105 - Gwihen Etienne:
Linear extensions of finite posets and a conjecture of G. Kreweras on permutations. 107-111
Volume 52, Numbers 2-3, 1984
- Vladimir Batagelj
:
Inductive definition of two restricted classes of triangulations. 113-121 - Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche:
On linear k-arboricity. 123-132 - Anne Delandtsheer:
Metrical regularity in the incidence graph of a finite linear space. 133-141 - Aldo de Luca:
On the product of square-free words. 143-157 - Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead:
A new method of proving theorems on chromatic index. 159-164 - Peter C. Fishburn:
Paradoxes of two-length interval orders. 165-175 - András Gyárfás, Jenö Lehel, Zsolt Tuza:
The structure of rectangle families dividing the plane into maximum number of atoms. 177-198 - Marie-Claude Heydemann, Dominique Sotteau:
Number of arcs and cycles in digraphs. 199-207 - Henk D. L. Hollmann:
Pseudocyclic 3-class association schemes on 28 points. 209-224 - H. J. Krol, Henk Jan Veldman:
On maximum critically h-connected graphs. 225-234 - G. E. Nicholson, Anthea Grubb, C. S. Sharma:
Regular join endomorphisms on a complemented modular lattice of finite rank. 235-242 - Zbigniew Palka, Louis V. Quintas:
Random subgraphs of the n-cycle. 243-251 - László Pyber:
An extension of a frankl-füredi theorem. 253-268 - Nicolae Tandareanu:
On generalized boolean functions III. the case A={ 0, 1 }. 269-277 - Thomas Zaslavsky:
How colorful the signed graph? 279-284 - Hanno Lefmann, Bernd Voigt:
A remark on infinite arithmetic progressions. 285-286 - Jaromir Abrham, Anton Kotzig:
Inequalities for perfect systems of difference sets. 287-291 - Hans Ludwig de Vries:
Historical notes on steiner systems. 293-297 - Jacques Justin, Giuseppe Pirillo:
Two combinatorial properties of partitions of the free semigroup into finitely many parts. 299-303 - Peter Kirschenhofer, Helmut Prodinger:
A short proof for a partition identity of Hwang and Wei. 305-306 - Alain Prodon:
A note on the separation problem for the matching matroid. 307-311 - Moshe Roitman:
An infinite family of integral graphs. 313-315
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-12-05 22:25 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:
