default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 1
Volume 1, Number 1, May 1971
- Paul Erdös:
On some extremal problems on r-graphs. 1-6 - Frank Harary, Phillip A. Ostrand:
The cutting center theorem for trees. 7-18 - Ole J. Heilmann, Daniel J. Kleitman, Elliott H. Lieb, Seymour Sherman:
Some positive definite functions on sets and their application to the Ising model. 19-27 - Gordon H. Bradley:
Transformation of integer programs to knapsack problems. 29-45 - Daniel J. Kleitman, M. Edelberg, David Lubell:
Maximal sized antichains in partial orders. 47-53 - C. J. Everett, P. R. Stein:
The asymptotic number of integer stochastic matrices. 55-72 - Ladislav Nebesky:
Left-right double trees. 73-81 - John W. Essam:
Graph theory and statistical physics. 83-112 - Earl Glen Whitehead Jr.:
Algebraic structure of chromatic graphs associated with the ramsey number N(3, 3, 3;2). 113-114
Volume 1, Number 2, September 1971
- Edward A. Bender:
A generalized q-binomial Vandermonde convolution. 115-119 - J. Adrian Bondy:
Large cycles in graphs. 121-132 - Juraj Bosák:
On the k-index of graphs. 133-146 - Michel Chein:
Sur l'epaisseur des graphes reguliers. 147-166 - Dominique de Werra:
Investigations on an edge coloring problem. 167-179 - Dominique Foata:
Enumerating k-trees. 181-186 - Harry Lakser:
The homology of a lattice. 187-192 - Patrick E. O'Neil:
Hyperplane cuts of an n-cube. 193-195 - Patrick E. O'Neil:
A constructive decomposition and Fulkerson's characterization of permutation matrices. 197-201 - W. T. Tutte:
On the 2-factors of bicubic graphs. 203-208 - Jean Mayer:
L'epaisseur du graphe complet de 46 sommets. 209-210
Volume 1, Number 3, December 1971
- Amos Altshuler:
Polyhedral realization in R3 of triangulations of the torus and 2-manifolds in cyclic 4-polytopes. 211-238 - Enrico G. Beltrametti:
Note on the p-adic generalization of Lorentz transformations. 239-246 - G. F. Clements:
More on the generalized Macaulay theorem. 247-255 - Jaroslav Nesetril
:
Homomorphisms of derivative graphs. 257-268 - Gert Sabidussi:
Meshes on 3-connected graphs. 269-276 - Douglass J. Wilde, J. M. Sanchez-Anton:
Multivariable monotonic optimization over multivalued logics and rectangular design lattices. 277-294
Volume 1, Number 4, February 1972
- Amos Altshuler:
Hamiltonian circuits in some maps on the torus. 299-314 - Jean Doyen:
A note on reverse Steiner triple systems. 315-319 - Dominique Dumont:
Sur une conjecture de Gandhi concernant les nombres de Genocchi. 321-327 - M. Herzog, Johanan Schönheim:
On certain sets of divisors of a number. 329-332 - Germain Kreweras:
Sur les partitions non croisees d'un cycle. 333-350 - Ioan Tomescu:
Le nombre maximal de 3-colorations d'un graphe connexe. 351-356 - S. G. Williamson:
The combinatorial analysis of patterns and the principle of inclusion-exclusion. 357-388
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-10-02 20:46 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:
