


default search action
The Australasian Journal of Combinatorics, Volume 9
Volume 9, March 1994
- David G. Glynn:
On the construction of arcs using quadrics. 3-20 - Jennifer Seberry, Xian-Mo Zhang:
Construction of bent functions from two known bent functions. 21-36 - Diane M. Donovan:
Some interesting constructions for secret sharing schemes. 37-66 - Rolf S. Rees, Alexander Rosa, Walter D. Wallis:
Maximal sets of triangle- factors. 67-108 - Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera:
Branched coverings of maps and lifts of map homomorphisms. 109-122 - Dingjun Lou:
Some conditions for n-extendable graphs. 123-136 - Peter B. Gibbons, Eric Mendelsohn, Hao Shen:
Antipodal triple systems. 137-152 - N. Anunchuen, Lou Caccetta:
On minimally k-extendable graphs. 153-168 - M. A. Salam, B. G. Wybourne:
Young raising operators and Q-functions. 169-178 - C. Paul Bonnington, Charles H. C. Little:
A combinatorial generalisation of the Jordan curve theorem. 179-200 - Abdollah Khodkar:
Various super-simple designs with block size four. 201-210 - Claude Berge:
About vertex-critical non-bicolorable hypergraphs. 211-220 - Stanislaw P. Radziszowski, Xia Jin:
Paths, cycles and wheels in graphs without antitriangles. 221-232 - Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
Three-valued k-neighborhood domination in graphs. 233-242 - Lou Caccetta, S. Mardiyono:
On the existence of almost-regular- graphs without one-factors. 243-260 - Marks R. Nester:
HAHA designs. 261-274 - Ferdinand Gliviak, Martin Knor, Lubomír Soltés:
On radially maximal graphs. 275-284 - Darryn E. Bryant, Saad I. El-Zanati, Robert B. Gardner:
Decompositions of Km, n and Kn into cubes. 285-290 - Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám:
Regular digraphs of diameter 2 and maximum order. 291-306 - Bert Randerath, Lutz Volkmann:
A characterization of well covered block-cactus graphs. 307-

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.