Report to the LMFBR Steering Committee on resources, fuel and fuel cycles, and proliferation aspects.

First edition Apr. 1977.

Business cycles and forecasting.

"First printing, February, 1940."

Business cycles: a selected list of references.

Mode of access: Internet.

Climatic cycles and tree-growth,

Includes bibliographical references.

The star of Bethlehem : a miracle play of the nativity, reconstructed from the Towneley and other old English cycles (of the XIIIth, XIVth and XVthe centuries) and supplemented and adapted to modern conditions /

Mode of access: Internet.

Der Ring des Nibelungen. A souvenir of three Wagner cycles at the Royal Opera House, Convent Garden. Volume II.

Mode of access: Internet.

Business cycles. [Miscellaneous bulletins]

Binder's title.

The Russian story book, containing tales from the song-cycles of Kiev and Novgorod and other early sources,

Mode of access: Internet.

Energy and labor cost of alternative coal-electric fuel cycles /

"Project no. 80.172."

Elizabethan sonnet-cycles /

v. 1. Phillis, by T. Lodge. Licia, by G. Fletcher.--v. 2. Delia, by S. Daniel. Diana, by H. Constable.--v. 3. Idea, by M. Drayton. Fidessa, by B. Griffin.--v. 4. Caelia, by F. Greville, Lord Brooke.

Divine providence, or, The three cycles of revelation : showing the parallelism of the patriarchal, Jewish, and Christian dispensations : being a new evidence of the divine origin of Christianity /

Includes bibliographical references.

Horseless vehicles, automobiles, motor cycles operated by steam, hydro-carbon, electric and pneumatic motors; a practical treatise for ... everyone interested in the development, use and care of the automobile, including a special chapter on how to build an electric cab, with detail drawings.

Mode of access: Internet.

Motor cycles and how to manage them /

Mode of access: Internet.

Decompositions of complete graphs into triangles and Hamilton cycles

For all odd integers n greater than or equal to 1, let G(n) denote the complete graph of order n, and for all even integers n greater than or equal to 2 let G,, denote the complete graph of order n with the edges of a 1-factor removed. It is shown that for all non-negative integers h and t and all positive integers n, G, can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G(n). (C) 2004 Wiley Periodicals, Inc.