default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 17
Volume 17, Number 1, 1977
- Rudolf Ahlswede, Gyula O. H. Katona:
Contributions to the geometry of hamming spaces. 1-22 - Claude Berge, A. Ramachandra Rao:
A combinatorial problem in logic. 23-26 - C. J. Everett, P. R. Stein:
The combinatorics of random walk with absorbing barriers. 27-45 - Robert B. Feinberg:
Characterization of incidence algebras. 47-70 - J. I. Hall, A. J. F. M. Jansen, Antoon W. J. Kolen, Jack H. van Lint:
Equidistant codes with distance 12. 71-83 - J. I. Hall:
Bounds for equidistant codes and partial projective planes. 85-94 - E. Pichat:
The disengagement algorithm or a new generalization of the exclusion algorithm. 95-106 - Glânffrwd P. Thomas:
On a construction of schützenberger. 107-118
Volume 17, Number 2, 1977
- H. L. Abbott, Denis Hanson:
On finite Δ-systems II. 121-126 - J. Beck:
On a combinatorial problem of P. Erdös and L. Lovász. 127-131 - L. Carlitz:
Alternating sequences. 133-138 - William Edwin Clark:
Equidistant cyclic codes over GF(q). 139-141 - Robert James Douglas:
Bounds on the number of Hamiltonian circuits in the n-cube. 143-146 - J. K. Doyle, Jack E. Graver:
Mean distance in a graph. 147-154 - Stephane Foldes:
A characterization of hypercubes. 155-159 - Alexandr V. Kostochka:
The total coloring of a multigraph with maximal degree 4. 161-163 - Michel Latteux:
Problems decidables concernant les tol-langages unaires. 165-172 - John I. Moore Jr.:
Interval hypergraphs and D-interval hypergraphs. 173-179 - Ronald L. Rivest:
The game of "N questions" on a tree. 181-186 - Michel Serfati:
Une methode de resolution des equations postiennes a partir d'une solution particuliere. 187-189 - F. Sterboul:
A problem on triples. 191-198 - Aimo Tietäväinen:
Nonexistence of nontrivial perfect codes in case q = pr1p12, e ⩾ 3. 199-205 - Mars K. Valiev:
Universal group with twenty-one defining relations. 207-213 - Douglas R. Woodall:
A note on rank functions and integer programming. 215-218
Volume 17, Number 3, 1977
- S. Bhaskara Rao:
Characterization of self-complementary graphs with 2-factors. 225-233 - Marc R. Best, Andries E. Brouwer:
The triply shortened binary Hamming code is optimal. 235-245 - Michael Broué:
Codes correcteurs d'erreurs auto-orthogonaux sur le corps a deux elements et formes quadratiques entieres definies positives a discriminant +1. 247-269 - Maria Eftimie, Radu Eftimie:
A decomposition property of basic acyclic graphs. 271-279 - Jerrold R. Griggs, Daniel J. Kleitman:
A three part Sperner theorem. 281-289 - John Mitchem:
An extension of Brooks' theorem to n-degenerate graphs. 291-298 - AndréD. Paradis:
Regular subsets in semi-direct products of monoids. 299-307 - Antonio Restivo:
On codes having no finite completions. 309-316 - Joseph Zaks:
Non-Hamiltonian non-Grinbergian graphs. 317-321 - Jean Paul Bordat:
Note sur la recherche des monomes maximaux en algebre de post. 323-326 - Judith Q. Longyear:
Common transversals in partitioning families. 327-329
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 2026-07-30 00:04 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
