default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 5
Volume 5, March 1992
- Roger B. Eggleton, Derek A. Holton, Charles H. C. Little:
Cycles and paths in multigraphs. 3-12 - Brendan D. McKay, Stanislaw P. Radziszowski:
A new upper bound on the Ramsey number R(5, 5). 13-20 - Mieko Yamada:
Generalized relative difference sets and PBIBDs associated with amorphous association schemes over an extension ring of Z/4Z. 21-42 - Dwight R. Bean, Gernot M. Engel:
Satellite communications and multigraph edge-coloring. 43-52 - Morimasa Tsuchiya:
On shifted intersecting families with respect to posets. 53-58 - Elizabeth J. Billington, D. G. Hoffman:
Pairs of simple balanced ternary designs with prescribed numbers of triples in common. 59-72 - Lou Caccetta, Purwanto:
Deficiencies of connected regular triangle free graphs. 73-86 - C. Paul Bonnington, C. H. C. Little:
The classification of combinatorial surfaces using 3-graphs. 87-102 - Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
The spectrum for 3-perfect 9-cycle systems. 103-108 - D. H. Anderson, R. Brown:
Combinatorial aspects of C.A.R. Hoare's FIND algorithm. 109-120 - David G. Glynn, Günter F. Steinke:
Groups of generalised projectivities in projective planes of odd order. 121-144 - Rudolf Mathon, Dennis Lomas:
A census of 2-(9, 3, 3) designs. 145-158 - Ebadollah S. Mahmoodian, M. Shirdarreh:
Some new families of simple t-designs. 159-168 - Biagio Micale, Mario Pennisi:
Constructions of simple Mendelsohn designs. 169-178 - K. Budayasa, Lou Caccetta, K. Vijayan:
The characterization of edge-maximal critically k-edge connected graphs. 179-208 - J. R. Elliott, Peter B. Gibbons:
The construction of subsquare free Latin squares by simulated annealing. 209-228 - Lou Caccetta, S. Mardiyono:
Premature sets of one-factors. 229-252 - Khee Meng Koh, K. S. Poh:
On the spectrum of the closed-set lattice of a graph. 253-260 - N. R. Achuthan, Lou Caccetta:
Minimum weight spanning trees with bounded diameter. 261-276 - Michael D. Hendy:
The path sets of weighted partially labelled trees. 277-284 - Les R. Foulds, Derek R. O'Connor:
Heuristics for sparse general travelling salesman problems. 285-292 - Xiaoji Wang:
Asymptotic enumeration of Eulerian digraphs with multiple edges. 293-298 - Wang Jian Zhong:
A sufficient condition for Hamiltonian cycles in bipartite tournaments. 299-
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-10-31 21:55 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:
