default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 30
Volume 30, Number 1, 1980
- Dominique Foata, Marcel Paul Schützenberger:
H.O. Foulkes (1907-1977). 1 - Herbert Owen Foulkes:
Eulerian numbers, Newcomb's problem and representations of symmetric groups. 3-49 - Jacques Désarménien:
An algorithm for the rota straightening formula. 51-68
Volume 30, Number 2, 1980
- Alphonse Baartmans, Kenneth J. Danhof, Soon Teck Tan:
Quasi-residual quasi-symmetric designs. 69-81 - A. Békéssy, János Demetrovics, László Hannák, Peter Frankl, Gyula O. H. Katona:
On the number of maximal dependencies in a data base relation of fixed order. 83-88 - F. R. K. Chung:
On the coverings of graphs. 89-93 - Lane H. Clark, Roger C. Entringer, Douglas E. Jackson:
Minimum graphs with complete k-closure. 95-101 - Paul Erdös, János Pach:
On a problem of L. Fejes Tóth. 103-109 - Alexandru Filipoiu:
Representation of Lukasiewicz algebras by means of ordered stone spaces. 111-116 - Stéphane Foldes, Gert Sabidussi:
On semigroups of graph endomorphisms. 117-120 - Emden R. Gansner:
On the equality of two plane partition correspondences. 121-132 - David M. Jackson, Barbara Jeffcott, William T. Spears:
The enumeration of sequences with respect to structures on a bipartition. 133-149 - Daniel J. Kleitman, James B. Shearer:
Further gossip problems. 151-156 - Rudolf Mathon, Scott A. Vanstone:
On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. 157-172 - Robert A. Proctor, Michael E. Saks, Dean G. Sturtevant:
Product partial orders with the sperner property. 173-180 - Rick Giles, Ravindran Kannan:
A characterization of threshold matroids. 181-184 - András Gyárfás:
Still another triangle-free infinite-chromatic graph. 185 - Eric Goles, J. Olivos:
Periodic behaviour of generalized threshold functions. 187-189
Volume 30, Number 3, 1980
- Ron Aharoni:
A problem in rearrangements of (0, 1) matrices. 191-201 - David P. Brown:
Compound connection matrices. 203-209 - L. Carlitz:
Explicit formulas for the Dumont-Foata polynomial. 211-225 - T. C. Enns:
Convex 4-valent polytopes. 227-234 - András Gyárfás, Endre Szemerédi, Zsolt Tuza:
Induced subtrees in graphs of large chromatic number. 235-244 - Jenö Lehel, Zsolt Tuza:
Ensembles d'articulation d'un graphe γ-critique. 245-248 - Sostens Lins:
A sequence representation for maps. 249-263 - David Magagnosc:
Recurrences and formulae in an extension of the Eulerian numbers. 265-268 - Lynn Hauser Pearce:
Random walks on trees. 269-276 - László Surányi:
On a generalization of linecritical graphs. 277-287 - David P. Dailey:
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. 289-293 - Jean-Claude Bermond, Peter Frankl, F. Sterboul:
On the maximum number of edges in a hypergraph whose linegraph contains no cycle. 295-298 - Norman L. Biggs, M. J. Hoare:
A trivalent graph with 58 vertices and girth 9. 299-301 - Guy Farhi:
On a problem of chvatal. 303-304 - Takao Nishizeki:
A 1-tough nonhamiltonian maximal planar graph. 305-307
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-15 00:53 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.
