default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 76
Volume 76, Number 1, 1989
- Ludwig Danzer:
Three-dimensional analogs of the planar penrose tilings and quasicrystals. 1-7 - Jean-Pierre Barthélemy:
From copair hypergraphs to median graphs with latent vertices. 9-28 - Ryoh Fuji-Hara, Shinya Kuriki, Masakazu Jimbo:
On balanced complementation for regular t-wise balanced designs. 29-35 - Nathalie Homobono, Claudine Peyrat:
Graphs such that every two edges are contained in a shortest cycle. 37-44 - Frans C. Bussemaker, Vladimir D. Tonchev
:
New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28. 45-49 - Peter Frankl:
A lower bound on the size of a complex generated by an antichain. 51-56 - Guy Valette:
A better packing of ten equal circles in a square. 57-59 - Joel V. Brawley, L. Carlitz:
A test for additive decomposability of irreducibles over a finite field. 61-65 - Armel Mercier:
Identities containing Gaussian binomial coefficients. 67-73
Volume 76, Number 2, 1989
- E. Barbut, Arie Bialostocki:
A generalization of rotational tournaments. 81-87 - Jean Berstel, Maxime Crochemore, Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid. 89-94 - Paul A. Catlin:
Spanning eulerian subgraphs and matchings. 95-116 - Ernest J. Cockayne, Christina M. Mynhardt:
On the product of upper irredundance numbers of a graph and its complement. 117-121 - Gérard Duchamp, Jean-Yves Thibon:
Le support de l'algebre de lie libre. 123-129 - V. Linek:
Bipartite graphs can have any number of independent sets. 131-136 - Annie-Françoise Mouyart:
Decomposition of the complete hypergraph into hyperclaws. 137-150 - Dieter Gernert:
Inequalities between the domination number and the chromatic number of a graph. 151-153 - Ilona Palásti:
A distance problem of P. Erdös with some further restrictions. 155-156
Volume 76, Number 3, 1989
- David J. Aldous:
The harmonic mean formula for probabilities of unions: applications to sparse random graphs. 167-176 - K. T. Arasu:
Cyclic affine planes of even order. 177-181 - R. M. Damerell, Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, V. 183-189 - Ronald D. Dutton, Robert C. Brigham:
On the size of graphs of a given bandwidth. 191-195 - N. Duvdevani, Aviezri S. Fraenkel:
Properties of K-Welter's game. 197-221 - Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel:
Irregular networks, regular graphs and integer matrices with distinct row and column sums. 223-240 - Martin Loebl, Svatopluk Poljak:
A hierarchy of totally unimodular matrices. 241-246 - Hugo H. Torriani:
Constructive implicit function theorems. 247-269 - R. Louise Woodburn:
A 4-color theorem for the Klein Bottle. 271-276 - C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard:
The minimum size of graphs hamiltonian-connected from a vertex. 277-278 - James G. Oxley:
A note on Negami's polynomial invariants for graphs. 279-281 - Alexander Pott:
A note on self-orthogonal codes. 283-284 - George Steiner:
Minimizing bumps in ordered sets by substitution decomposition. 285-289 - Mieczyslaw Wojtas:
Some new matrices-minus-diagonal and MOLS. 291-292
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-01-08 20:20 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:
