default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 49
Volume 49, Number 1, March 1984
- Rudolf Ahlswede, Abbas El Gamal, King F. Pang:
A two-family extremal problem in hamming space. 1-5 - Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi:
A note on total domination. 7-13 - Mao-cheng Cai:
On separating systems of graphs. 15-20 - C. C. Chen, Khee Meng Koh, S. C. Lee:
On the grading numbers of direct products of chains. 21-26 - Marsha F. Foregger:
The skew chromatic index of a graph. 27-39 - Ira M. Gessel:
Some generalized Durfee square identities. 41-44 - Pavol Hell, David G. Kirkpatrick:
Packings by cliques and by finite families of graphs. 45-59 - George R. T. Hendry:
Graphs uniquely hamiltonian-connected from a vertex. 61-74 - Joseph P. S. Kung:
Jacobi's identity and the König-Egerváry theorem. 75-77 - Gunter Lassmann:
On 4-isomorphisms of graphs. 79-81 - Victor Neumann-Lara, Jorge Urrutia:
Vertex critical r-dichromatic tournaments. 83-87 - Rodica Simion:
The lattice automorphisms of the dominance ordering. 89-93 - R. E. Strong:
Group actions on finite spaces. 95-100 - Andries E. Brouwer:
Distance regular graphs of diameter 3 and strongly regular graphs. 101-103 - Jirí Tuma
:
Note on binary simplicial matroids. 105-107
Volume 49, Number 2, April 1984
- Curtis A. Barefoot:
Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. 109-112 - Lynn Margaret Batten:
Rank functions of closure spaces of finite rank. 113-116 - Lucian Beznea:
A topological characterization of complete distributive lattices. 117-120 - Afrodita Iorgulescu:
Functors between categories of three-valued Lukasiewicz-Moisil algebras I. 121-131 - Francesco Mazzocca:
On a class of lattices associated with n-cubes. 133-138 - Armel Mercier:
Quelques identités de l'analyse combinatoire. 139-149 - K. R. Parthasarathy, N. Srinivasan:
An extremal problem in geodetic graphs. 151-159 - Ján Plesník:
A note on the complexity of finding regular subgraphs. 161-167 - H. J. Ryser:
Matrices and set differences. 169-173 - William Staton:
Induced forests in cubic graphs. 175-178 - Fumikazu Tamari:
On linear codes which attain the Solomon-Stiffler bound. 179-191 - R. Aravamudhan, B. Rajendran:
On antipodal graphs. 193-195 - Béla Bollobás, Ernest J. Cockayne:
The irredundance number and maximum degree of a graph. 197-199 - Aruna Sharma:
A note on stability of graphs. 201-203 - A. Donald Keedwell:
More super p-groups. 205-207 - Michel Mollard:
Une nouvelle famille de 3-codes parfaits sur GF(q). 209-212 - Vladimir D. Tonchev:
The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas partial geometries. 213-217 - Brian Alspach:
Research problems. 219
Volume 49, Number 3, May 1984
- George E. Andrews, David M. Bressoud:
Identities in combinatorics III: Further aspects of ordered set sorting. 223-236 - Ronald V. Book, Craig C. Squier:
Almost all one-rule thue systems have decidable word problems. 237-240 - Andrei Z. Broder:
The r-Stirling numbers. 241-259 - Charles Delorme, Gena Hahn:
Infinite generalized friendship graphs. 261-266 - Charles Payan, Maurice Tchuenté, Nguyen Huy Xuong:
Arbres avec un nombre maximum de sommets pendants. 267-273 - Andrzej Proskurowski:
Separating subgraphs in k-trees: Cables and caterpillars. 275-285 - Andrzej Rucinski:
The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. 287-290 - György Turán:
On the definability of properties of finite graphs. 291-302 - Jörg M. Wills:
Finite platonic graphs. 303-308 - J. Csima:
Colouring finite planes of odd order. 309 - Hiroshi Maehara:
On the sphericity for the join of many graphs. 311-313 - Ján Plesník:
Equivalence between the minimum covering problem and the maximum matching problem. 315-317 - Doron Zeilberger:
A combinatorial proof of Newton's identities. 319 - Noga Alon:
A note on subdigraphs of digraphs with large outdegrees. 321-322 - Françoise Reynaud Garoche, Michel Léonard:
On a class of boolean functions with matroid property. 323-325 - G. W. Peck:
A new proof of a theorem of Graham and Pollak. 327-328
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-01-30 23:02 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:
