default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 10
Volume 10, September 1994
- Christos Koukouvinos, Stratis Kounias, Jennifer Seberry, C. H. Yang, Joel Yang:
Multiplication of sequences with zero autocorrelation. 5-16 - Zevi Miller, Manley Perkel:
A stability theorem for the automorphism groups of powers of the n-cube. 17-28 - Timothy J. Bean, Michael A. Henning, Henda C. Swart:
On the integrity of distance domination in graphs. 29-44 - Beiliang Du:
On the existence of self-orthogonal diagonal Latin squares. 45-50 - N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen:
Computational methods for the diameter restricted minimum weight spanning tree problem. 51-72 - Watcharaphong Ananchuen, Lou Caccetta:
On constructing graphs with a prescribed adjacency property. 73-84 - Frank Ruskey, Carla D. Savage:
Gray codes for set partitions and restricted growth tails. 85-96 - A. El Maftouhi, L. Marquez Gordones:
The maximum order of a strong matching in a random graph. 97-104 - Robert Jajcay, Jozef Sirán:
A construction of vertex-transitive non-Cayley graphs. 105-114 - Helen Gustafson, Anthony N. Pettitt, Ed Dawson, L. J. O'Connor:
Linear dependencies in product ciphers. 115-130 - Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
Cryptographic Boolean functions via group Hadamard matrices. 131-146 - Tim G. Lavers:
Fibonacci numbers, ordered partitions, and transformations of a finite set. 147-152 - Hiroshi Kimura:
Extremal doubly even (56, 28, 12) codes and Hadamard matrices of order 28. 153-162 - Margaret B. Cozzens, Shu-Shih Y. Wu:
Edge-neighbor-integrity of trees. 163-174 - R. Julian R. Abel, Y. W. Cheng:
Some new MOLS of order 2np for p a prime power. 175-186 - Wen-Ai Jackson:
Interchanges and statistical designs. 187-192 - Armen S. Asratian:
A criterion for some Hamiltonian graphs to be Hamilton-connected. 193-198 - K. T. Arasu, Alexander Pott:
Variations on the McFarland and Spence constructions of difference sets. 199-204 - Hong Wang:
Packing a forest with a graph. 205-210 - Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely:
On the Wiener index of trees from certain families. 211-224 - Hadi Kharaghani:
On the asymptotic existence of complex Williamson Hadamard matrices. 225-230 - Gregory Z. Gutin:
Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs. 231-236 - Mieko Yamada:
The construction of four-weight spin models by using Hadamard matrices and M-structure. 237-244 - Beiliang Du:
A few more BIBDs with k=8 or 9. 245-250 - Wolf H. Holzmann, Hadi Kharaghani:
A computer search for complex Golay sequences. 251-258 - Dragomir Z. Djokovic:
Five new orders for Hadamard matrices of skew type. 259-264 - Tony Moran:
Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs. 265-288 - Marialuisa J. de Resmini:
Classroom note: Some partitions of S(2, 3, v2) and S(2, 4, 2). 289-292 - Janie Ailor Kennedy:
Corrigendum: Maximum packings of Kn with hexagons. 293-
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-12-04 01:28 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:
