Hughie Hamilton, Alex McDonald during Ky visit demonstration

Group of people including Hughie Hamilton, Alex McDonald and Vilma Ward during visit of former South Vietnamese vice president Nguyen Cao Ky to Brisbane, Australia in January 1967.

(FAB01_091) Book reviews

Leon Battista Alberti, 'On the Art of Building in Ten Books' Translated by Joseph Rykwert, Neil Leach and Robert Tavemor L. A. Zhadova (ed.), 'Tatlin' (Budapest 1984). English translation Helen Ross, 'Just For Living, Aboriginal Perceptions of Housing in North West Australia' Tony Fry, 'Design History Australia: A Source Text in Methods and Resources' Phillip Cox and David Moore, 'The Australian Functional Tradition' Lenore Coltheart and Don Fraser (eds.), 'Lamdmarks in Public Works, Engineers and Their Works in New South Wales 1884-1914' Peter Bridges and Don MacDonald, 'James Barnet, Colonial Architect' Don Watson and Judith McKay, 'A Directory of Queensland Architects to 1940' Russell Walden, 'Voices of Silence: New Zealand's Chapel of Futuna' Jeremy Salmond, 'Old New Zealand Houses 1800-1940' Victoria Middleton, 'The Legend of Green Valley' Dyranda Prevost and Ann Rado, 'Living Places' Mark Jackson and Mark Stiles (directors), 'Universal Provider' Lars Lerup, 'Planned Assaults'

Maximal sets of Hamilton cycles in Kn,n

In this article, we prove that there exists a maximal set of m Hamilton cycles in K-n,K-n if and only if n/4 < m less than or equal to n/2. (C) 2000 John Wiley & Sons, Inc.

On the Hamilton-Waterloo problem

The Hamilton-Waterloo problem asks for a 2-factorisation of K-v in which r of the 2-factors consist of cycles of lengths a(1), a(2),..., a(1) and the remaining s 2-factors consist of cycles of lengths b(1), b(2),..., b(u) (where necessarily Sigma(i)(=1)(t) a(i) = Sigma(j)(=1)(u) b(j) = v). In thus paper we consider the Hamilton-Waterloo problem in the case a(i) = m, 1 less than or equal to i less than or equal to t and b(j) = n, 1 less than or equal to j less than or equal to u. We obtain some general constructions, and apply these to obtain results for (m, n) is an element of {(4, 6)1(4, 8), (4, 16), (8, 16), (3, 5), (3, 15), (5, 15)}.