Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 65
Volume 65, Number 1, May 1987
- K. T. Arasu:
Number theoretic consequences on the parameters of a symmetric design. 1-4 - Frank E. Bennett, Lie Zhu:
Incomplete conjugate orthogonal idempotent latin squares. 5-21 - Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Lattice parallelotopes and disjoint covering systems. 23-46 - Thomas Bier:
A family of nonbinary linear codes. 47-51 - Lih-Hsing Hsu, Chiuyuan Chen, En-Yih Jean:
A class of additive multiplicative graph functions. 53-63 - Charles C. Lindner:
Construction of large sets of pairwise disjoint transitive triple systems II. 65-74 - Richard Stong:
On Hamiltonian cycles in Cayley graphs of wreath products. 75-80 - Jacques Wolfmann:
A group algebra construction of binary even self dual codes. 81-89 - Wenchang Chu:
A new combinatorial interpretation for generalized Catalan number. 91-94 - Pierre Duchet, Viktor Kaneti:
Sur la contraction des graphes orientes en K*3. 95-98 - H. M. Srivastava
:
Some generalizations of a combinatorial identity of L. Vietoris. 99-102 - William C. Waterhouse:
How often do determinants over finite fields vanish? 103-104
Volume 65, Number 2, June 1987
- Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno:
Graphs G for which G and _G are both semidecomposable. 109-114 - Joel V. Brawley, L. Carlitz:
Irreducibles and the composed product for polynomials over a finite field. 115-139 - Roger B. Eggleton:
Common factors of integers: A graphic view. 141-147 - Philippe Flajolet, Helmut Prodinger:
Level number sequences for trees. 149-156 - Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Box Game. 157-171 - Bruce Hedman:
Another extremal problem for Turan graphs. 173-176 - André Montpetit:
Note sur la notion d'equivalence entre deux codes lineaires. 177-185 - C. A. Rodger:
Embedding partial Mendelsohn triple systems. 187-196 - Shaoji Xu:
Some parameters of graph and its complement. 197-207 - Klaus Reuter:
Note on the Ahlswede-Daykin inequality. 209-212 - S. Sridharan:
Biregular subgraphs of biregular graphs. 213-214
Volume 65, Number 3, July 1987
- Stefan A. Burr:
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. 215-229 - Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel:
Sur les quasi-noyaux d'un graphe. 231-235 - Philippe Godlewski:
Wom-codes construits à partir des codes de hamming. 237-243 - Mark D. Halsey:
Line-closed combinatorial geometries. 245-248 - Meir Katchalski, Ted Lewis, A. Liu:
Geometric permutations of disjoint translates of convex sets. 249-259 - Alexander Rosa:
Repeated blocks in indecomposable twofold triple systems. 261-276 - J. M. S. Simões-Pereira:
A note on distance matrices with unicyclic graph realizations. 277-287 - Douglas R. Stinson:
Frames for Kirkman triple systems. 289-300 - Luc Teirlinck:
Non-trivial t-designs without repeated blocks exist for all t. 301-311 - E. J. F. Primrose:
A correspondence between two Catalan sets. 313-315 - Bruce A. Reed:
A note on even pairs. 317-318 - Adolfo Sánchez-Flores:
A counterexample to a generalization of Richardson's theorem. 319-320
a service of 
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-04-25 05:29 CEST 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:
