History of Ipswich, Essex, and Hamilton /

Mode of access: Internet.

The administration of the Hamilton County Welfare Department, prepared for the Board of County Commissioners, Hamilton County, Ohio.

Cover title.

The works of Alexander Hamilton,

First edition (500 copies) in 9 vols., published 1885-86.

Das Verhaltnis des "Nouveau Testament" von Geffroi de Paris zu der "Conception Notre-Dame" von Wace, zu der Handschrift ADD. 15606 des Britischen Museums und zu der Hamilton Handschrift No. 273 des Fitzwilliam Museums zu Cambridge.

Thesis (doctoral)--Universitat Greifswald.

Pronomen, Artikel und Zahlwort in dem 1617 erschienenen Gedicht "La Mageleine" von F. Remy de Beauvais.

Thesis (doctoral)--Universitat Gteifswald.

Das Verhaltnis von Remy Belleau's Steingedicht "Les amours et nouveaux eschanges des pierres precieuses, vertus et proprietez d'Icelles" zu den fruheren Steinbuchern und den sonstigen Quellen.

Thesis (doctoral)--Universitat Leipzig.

S.W. Hamilton und die neueste Psychologie.

Thesis (doctoral)--K.B. Ludwig-Maximilians-Universitat zu Munchen.

The metaphysics of Sir William Hamilton, collected, arranged and abridged for the use of colleges and private students.

Mode of access: Internet.

Cincinnati, Hamilton & Dayton railroad company. Report of committee of stockholders, appointed May 12th, 1874, to examine annual reports and management.

Mode of access: Internet.

Projected effects of ground-water withdrawals in the Arkansas River Valley, 1980-99, Hamilton and Kearny Counties, southwestern Kansas /

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.