Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 4
Volume 4, September 1991
- Sharon G. Boswell:
Bounds on the number of Γ-operation edge substitutions required to transform a maximal planar graph into another. 5-24 - Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely:
Extremal problems for local properties of graphs. 25-32 - Douglas R. Stinson, Lie Zhu:
On the existence of three MOLS with equal-sized holes. 33-48 - Marston D. E. Conder:
Random walks in large finite groups. 49-58 - Ed Dawson, Helen Gustafson, N. Davies:
Black box analysis of stream ciphers. 59-70 - M. A. Forbes, J. N. Holt, P. J. Kilby, A. M. Watts:
A matching algorithm with applications to bus operations. 71-86 - Jennifer Seberry:
Existence of SBIBD(4k2, 2k2±k, k2±k) and Hadamard matrices with maximal excess. 87-92 - Jennifer Seberry, Xian-Mo Zhang:
Some orthogonal designs and complex Hadamard matrices by using two Hadamard matrices. 93-102 - James Abello, Michael R. Fellows, John Stillwell:
On the complexity and combinatorics of covering finite complexes. 103-112 - Joan Cooper, Diane M. Donovan, Jennifer Seberry:
Latin squares and critical sets of minimal size. 113-120 - Douglas R. Shier, M. H. McIlwain:
Inclusion-exclusion, cancellation, and consecutive sets. 121-142 - Charles J. Colbourn, Alexander Rosa:
Leaves, excesses and neighbourhoods in triple systems. 143-178 - Charles C. Lindner, Eric Mendelsohn, C. A. Rodger:
The intersection problem for minimum coverings of Kn by triples. 179-198 - Lou Caccetta, Purwanto:
Deficiencies of r-regular k-edge-connected graphs. 199-228 - Qui-rong Wu:
A note on extending t-designs. 229-236 - Cheryl E. Praeger:
On minimal symmetric automorphism groups of finite symmetric graphs. 237-252 - R. G. Stanton:
The geometric points of coverings. 253-260 - Heiko Harborth, Hartmut Weiss:
Minimum sets of partial polyominoes. 261-268 - Gerhard Behrendt:
Some sharply transitive partially ordered sets. 269-276 - David G. Glynn:
The construction of self-dual binary codes from projective planes of odd order. 277-284 - M. E. Morley:
The complements of some covering designs and questions on the overall significance. 285-
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-07-17 21:26 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:
