default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 29
Volume 29, Number 1, 1980
- Michael O. Albertson, Joan P. Hutchinson:
Hadwiger's conjecture for graphs on the Klein bottle. 1-11 - Marilena Barnabei, Andrea Brini:
A class of pbib-designs obtained from projective geometries. 13-17 - L. Csmiraz:
On a combinatorial game with an application to Go-moku. 19-23 - Geoffrey Exoo, Frank Harary:
The smallest graphs with certain adjacency properties. 25-32 - Medha Javdekar:
Characterization of forcibly k-variegated degree sequences, k⩾3. 33-38 - Maryvonne Mahéo:
Strongly graceful graphs. 39-46 - Charles Payan:
A class of threshold and domishold graphs: equistable and equidominating graphs. 47-52 - Najiba Sbihi:
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile. 53-76 - Scott A. Vanstone:
Doubly resolvable designs. 77-86 - Joseph Zaks:
Non-Hamiltonian simple 3-polytopes having just two types of faces. 87-101 - James B. Shearer:
A note on circular dimension. 103
Volume 29, Number 2, 1980
- G. Boccara:
Nombre de representations d'une permutation comme produit de deux cycles de longueurs donnees. 105-134 - Gérard Cornuéjols, William R. Pulleyblank:
A matching problem with side conditions. 135-159 - Edward J. Farrell:
Chromatic roots - some observations and conjectures. 161-167 - Basil Gordon:
Tilings of lattice points in Euclidean n-space. 169-174 - Dan Gordon:
Minimal determining sets of locally finitely-determined functionals. 175-190 - T. C. Hine, Vassili C. Mavron:
Embeddable transversal designs. 191-200 - Michael S. Jacobson:
A note on Ramsey multiplicity. 201-203 - D. E. Keenan:
A Fisher type inequality. 205-208 - R. N. Mohan:
A note on the construction of certain BIB designs. 209-211 - Daniel I. A. Cohen, Talbot M. Katz:
Recurrence of a random walk on the half-line as the generating function for the Catalan numbers. 213-214 - Kenneth A. Berman:
A note on coloured quadrangulations. 215-217
Volume 29, Number 3, 1980
- Thomas Andreae:
On a problem of R. Halin concerning infinite graphs II. 219-227 - Joel Berman:
A proof of Lyndon's finite basis theorem. 229-233 - Jean Berstel:
Mots sans carre et morphismes iteres. 235-244 - Anders Björner, Ivan Rival:
A note on fixed points in semimodular lattices. 245-250 - Yung-Ching Chu:
Some results on Hu's conjecture concerning binary trees. 251-255 - Edward J. Farrell:
On chromatic coefficients. 257-264 - Clement W. H. Lam:
Distance transitive digraphs. 265-274 - George Markowsky:
The level polynomials of the free distributive lattices. 275-285 - Bill Sands:
Generating sets for lattices of dimension two. 287-292 - Paul D. Seymour
:
Disjoint paths in graphs. 293-309 - Jean-Pierre Barthélemy:
An asymptotic equivalent for the number of total preorders on a finite set. 311-313
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-10 00:51 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.
