default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 59
Volume 59, Numbers 1-2, April 1986
- Kenneth A. Berman:
Parity results on connected f-factors. 1-8 - Wayne M. Dymàcek:
Bipartite Steinhaus graphs. 9-20 - Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
Coloring graphs with locally few colors. 21-34 - Hortensia Galeana-Sánchez:
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. 35-41 - David G. Glynn:
The non-classical 10-arc of PG(4, 9). 43-51 - Michael Hager:
Path-connectivity in graphs. 53-59 - András Hajnal, Norbert Sauer:
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. 61-67 - Katherine Heinrich, Lie Zhu:
Existence of orthogonal latin squares with aligned subsquares. 69-78 - Alain Hertz:
Quelques utilisations de la struction. 79-89 - Vikram Jha, Norman L. Johnson:
Regular parallelisms from translation planes. 91-97 - R. P. Nederpelt:
Bijections between formulae and trees which are compatible with equivalences of the type ((f·g)·h)~((f·h)·g). 99-105 - P. J. Owens:
Simple 3-polytopal graphs with edges of only two types and shortness coefficients. 107-114 - D. Piollet:
Solutions d'une equation quadratique dans le groupe libre. 115-123 - Vojtech Rödl:
On universality of graphs with uniformly distributed edges. 125-134 - Michael E. Saks:
Some sequences associated with combinatorial structures. 135-166 - Yongbing Shi:
Some theorems of uniquely pancyclic graphs. 167-180 - R. J. Simpson:
Exact coverings of the integers by arithmetic progressions. 181-190 - Mauro Cerasoli:
Enumeration with the lattice of periods. 191-198 - A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham:
Extension of a clique cover result to uniform hypergraphs. 199-201
Volume 59, Number 3, May 1986
- Albrecht Beutelspacher, Inge Schestag:
Finite linear spaces in which any n-gon is euclidean. 207-220 - Arie Bialostocki, Norbert Sauer:
On Ramsey-Turán type problems in tournaments. 221-228 - James R. Clay:
More balanced incomplete block designs from frobenius groups. 229-234 - Paul Erdös, Marcel Erné:
Clique numbers of graphs. 235-242 - Alan M. Frieze
:
On large matchings and cycles in sparse random graphs. 243-256 - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernel-perfect critical digraphs. 257-265 - David A. Gregory, Sean McGuinness, Walter D. Wallis:
Clique partitions of the cocktail party graph. 267-273 - Alan Hartman:
On small packing and covering designs with block size 4. 275-281 - W. Cary Huffman:
On automorphism groups of certain 2-(v, 3, 2) designs induced by group actions. 283-296 - Bernhard Korte, László Lovász:
Non-interval greedoids and the transposition property. 297-314 - Andries E. Brouwer:
An inequality in binary vector spaces. 315-317 - Bernt Lindström:
A non-linear algebraic matroid with infinite characteristic set. 319-320
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-04 22:09 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:
