default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 70
Volume 70, Number 1, June 1988
- David W. Barnette:
Decomposition theorems for the torus, projective plane and Klein bottle. 1-16 - Odile Favaron:
Two relations between the parameters of independence and irredundance. 17-20 - George R. T. Hendry:
The multiplicity of 1-factors in total graphs. 21-25 - Bjarni Jónsson:
Relation algebras and Schröder categories. 27-45 - Dongsu Kim:
The number of convex polyominos with given perimeter. 47-51 - Klaus Metsch:
An optimal bound for embedding linear spaces into projective planes. 53-70 - Daniel A. Rawsthorne:
Tiling complexity of small n-ominoes (N < 10). 71-75 - Attila Sali:
Constructions of ranked posets. 77-83 - Pham Dinh Tao, Souad El Bernoussi:
Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function. 85-101 - Preben D. Vestergaard:
Graphs with one isomorphism class of spanning unicyclic graphs. 103-108 - Dragan M. Acketa:
On binary paving matroids. 109-110
Volume 70, Number 2, 1988
- Graham R. Brightwell:
Linear extensions of infinite posets. 113-136 - Gregory A. Freiman, E. Lipkin, L. Levitin:
A polynomial algorithm for constructing families of k-independent sets. 137-147 - Alan M. Frieze
:
Partitioning random graphs into large cycles. 149-158 - Seiya Negami:
The spherical genus and virtually planar graphs. 159-168 - Richard J. Nowakowski, Ivan Rival:
Retract rigid cartesian products of graphs. 169-184 - Gerald Schrag:
Automorphism groups and the full state spaces of the Petersen graph generalizations of G32. 185-198 - E. Seah, Douglas R. Stinson:
A perfect one-factorization for K36. 199-202 - Robert G. Bland, Brenda L. Dietrich:
An abstract duality. 203-208 - John C. Cock:
Toroidal tilings from de Bruijn-Good cyclic sequences. 209-210 - Sharad S. Sane:
Hussain chains revisited. 211-213
Volume 70, Number 3, August 1988
- Douglas G. Rogers:
An arithmetic of complete permutations with constraints, I: an exposition of the general theory. 219-240 - D. J. Crampin, Douglas G. Rogers:
An arithmetic of complete permutations with constraints, II: case studies. 241-256 - Steven E. Anacker:
The reconstruction of separable graphs with 2-connected trunks that are series-parallel networks. 257-275 - Stefan A. Burr:
On ramsey numbers for large disjoint unions of graphs. 277-293 - Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein:
The number of fixed points of the majority rule. 295-302 - Achim Bachem, Alfred Wanka:
Separation theorems for oriented matroids. 303-310 - Henry Meyniel, Jean-Pierre Roudneff:
The vertex picking game and a variation of the game of dots and boxes. 311-313 - R. H. Jeurissen:
A proof by graphs that PSL(2, 7) ~= PSL(3, 2). 315-317
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-31 20:18 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:
