default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 32
Volume 32, Number 1, 1980
- Dwight Duffus, Ivan Rival, Miklós Simonovits:
Spanning retracts of a partially ordered set. 1-7 - Reinhardt Euler:
Rank-axiomatic characterizations of independence systems. 9-17 - Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman:
Helly-type theorems about sets. 19-25 - Jacob E. Goodman:
Proof of a conjecture of Burr, Grünbaum, and Sloane. 27-35 - Ram Prakash Gupta, Jeff Kahn, Neil Robertson:
On the maximum number of diagonals of a circuit in a graph. 37-43 - David Klarner, Jordan Pollack:
Domino tilings of rectangles with fixed width. 45-52 - Peter Kleinschmidt:
A steinitz-type theorem for the projective plane. 53-57 - Oliver Pretzel:
A construction for partially ordered sets. 59-68 - James W. Reilly, Stephen M. Tanny:
Counting permutations by successions and other figures. 69-76 - Arthur J. Roth, Milton Sobel:
A probabilistically attained set of polynomials that generate stirling numbers of the second kind. 77-84 - J. Randolph Stonesifer:
Modularly complemented geometric lattices. 85-88 - Joram Hirschfeld:
A lower bound for Ramsey's theorem. 89-91 - Peter M. Winkler
:
On connectivity of triangulations of manifolds. 93-94 - Ottavio M. D'Antona, Joseph P. S. Kung:
Coherent orientations and series-parallel networks. 95-98
Volume 32, Number 2, 1980
- David Burns, S. F. Kapoor, Phillip A. Ostrand:
Edge cosymmetric graphs. 99-103 - Ralph J. Faudree, Richard H. Schelp, J. Sheehan:
Ramsey numbers for matchings. 105-123 - Philippe Flajolet:
Combinatorial aspects of continued fractions. 125-161 - Frank K. Hwang:
An explicit expression for the cost of a class of Huffman trees. 163-165 - Stephen B. Maurer, Issie Rabinovich, William T. Trotter:
A generalization of Turán's theorem to directed graphs. 167-189 - Mieczyslaw Wojtas:
New Wilson-type constructions of mutually orthogonal latin squares. 191-199 - Béla Bollobás:
The distribution of the maximum degree of a random graph. 201-203 - Chris D. Godsil:
More odd graph theory. 205-207 - Jean-Marie Laborde:
Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales. 209-212 - Alexander Schrijver:
A counterexample to a conjecture of Edmonds and Giles. 213-214
Volume 32, Number 3, 1980
- Annie Astié-Vidal:
Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid. 217-224 - John B. Florence:
Consanguinity graphs. 225-228 - T. Gangopadhyay, Surya Prakash Rao Hebbare:
Paths in r-partite self-complementary graphs. 229-244 - T. Gangopadhyay, Surya Prakash Rao Hebbare:
r-partite self-complementary graphs - diameters. 245-255 - Yahya Ould Hamidoune:
On critically h-connected simple graphs. 257-262 - Medha Javdekar:
Characterization of k-variegated graphs, k >= 3. 263-270 - Charles C. Lindner, N. S. Mendelsohn, S. R. Sun:
On the construction of Schroeder quasigroups. 271-280 - Hiroshi Maehara:
On time graphs. 281-289 - Gary L. Mullen, Robert E. Weber:
Latin cubes of order >=5. 291-297 - Joseph A. Thas:
Partial three-spaces in finite projective spaces. 299-322 - Robert Tijdeman:
The chairman assignment problem. 323-330 - Myriam Preissmann:
Even polyhedral decompositions of cubic graphs. 331-334
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-31 22:50 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:
