Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 1
Volume 1, March 1990
- Lou Caccetta, S. Mardiyono:
On maximal sets of one-factors. 5-14 - Lou Caccetta, Purwanto:
Deficiencies and vertex clique covering numbers of a family of trees. 15-28 - D. Chen, Douglas R. Stinson:
Recent results on combinatorial constructions for threshold schemes. 29-48 - Robert J. Clarke:
A note on the cycle index polynomial of the symmetric group. 49-52 - Ed Dawson, John A. Asenstorfer, P. Gray:
Cryptographic properties of Groth sequences. 53-66 - Warwick de Launey:
On the construction of n-dimensional designs from 2-dimensional designs. 67-82 - Diane M. Donovan:
The centre of a sloop. 83-90 - Ken Gray:
Further results on smallest defining sets of well known designs. 91-100 - Charles C. Lindner:
How to construct a block design with block size four admitting a blocking set. 101-126 - Paul Moore, Rolf S. Rees:
On the number of connecting lines determined by n points in the real plane. 127-148 - Christine M. O'Keefe:
Ovals in Desarguesian planes. 149-160 - William D. Palmer:
Generalized Bhaskar Rao designs with two association classes. 161-180 - Sandra J. Pattison, Deborah J. Street:
Small non-isomorphic repeated measurements designs. 181-192 - Cheryl E. Praeger:
Block-transitive designs and maximal subgroups of finite symmetric groups. 193-206 - R. G. Stanton, R. W. Buskens:
Excess graphs and bicoverings. 207-210 - Marta Sved:
Fractals, recursions, divisibility. 211-232 - W. D. Wallis, Julin Wu:
Generalized clique coverings of chordal graphs. 233-236 - Xiaoji Wang:
New results on the costs of Huffman trees. 237-
a service of 
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-04-19 19:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
