default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 68
Volume 68, Number 1, 1988
- H. L. Abbott, Meir Katchalski:
Snakes and pseudo-snakes in powers of complete graphs. 1-8 - Zhibo Chen, Fuji Zhang:
Bounds of the longest directed cycle length for minimal strong digraphs. 9-13 - John Greene:
Bijections related to statistics on words. 15-29 - John N. Hooker:
Networklike metric spaces. 31-43 - Christos Koukouvinos, Stratis Kounias:
Hadamard matrices of the Williamson type of order 4·m, m=p·q an exhaustive search for m=33. 45-57 - Stratis Kounias, Nikos Farmakis:
On the excess of Hadamard matrices. 59-69 - Germain Kreweras, Paul Moszkowski:
Signatures des permutations et des mots extraits. 71-76 - Bruce M. Landman, Raymond N. Greenwell:
Values and bounds for Ramsey numbers associated with polynomial iteration. 77-83 - Manoel Lemos:
An extension of Lindström's result about characteristic sets of matroids. 85-101 - Anne Delandtsheer:
Line-primitive groups of small rank. 103-106 - Mario Gionfriddo
, Salvatore Milici:
On the parameter v2(h)<=6h for L2-coloured graphs. 107-110 - Alain Hertz, Dominique de Werra:
Perfectly orderable graphs are quasi-parity graphs: a short proof. 111-113
Volume 68, Numbers 2-3, 1988
- Timothy J. Carlson:
Some unifying principles in Ramsey theory. 117-169 - Ren Ding, Krzysztof Kolodziejczyk, John R. Reay:
A new pick-type theorem on the hexagonal lattice. 171-177 - Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Factors and induced subgraphs. 179-189 - M. Reza Emamy-Khansary:
On the covering cuts of cd (d<=5). 191-196 - Rainer Feix:
On a property of graphs containing infinitely many isomorphic copies of themselves. 197-209 - Jerrold R. Griggs, Charles M. Grinstead, David R. Guichard:
The number of maximal independent sets in a connected graph. 211-220 - Stanley P. Gudder, G. T. Rüttimann:
Finite function spaces and measures on hypergraphs. 221-244 - Stanley P. Gudder, G. T. Rüttimann:
Positive sets in finite linear function spaces. 245-255 - Stephen C. Locke:
Extremal 3-connected graphs. 257-263 - Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West:
The addition game: an abstraction of a communication problem. 265-272 - Wiktor Piotrowski:
Chordal characterization of graphic matroids. 273-279 - Bruce E. Sagan:
Inductive and injective proofs of log concavity results. 281-292 - Benedict G. Seifert:
On the arithmetic of cycles for the Collatz-Hasse ('Syracuse') conjectures. 293-298 - John Sheehan:
Graph decomposition with constraints on the minimum degree. 299-307 - Joseph E. McCanna:
Orientations of the n-cube with minimum diameter. 309-313 - Robert Bruce Brown:
Nonexistence of a regular graph design with upsilon = 17 and k = 6. 315-318
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:
