[Grève des cheminots en Angleterre, les quais déserts de la gare de Waterloo à Londres] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 56127

The fifteen decisive battles of the world : form marathon to waterloo

UANL

The Fifteen Decisive Battles of the World from Marathon to Waterloo

UANL

Waterloo : la bataille de tous les enjeux

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Hamilton-Waterloo problem with triangle and C9 factors

The Hamilton-Waterloo problem and its spouse-avoiding variant for uniform cycle sizes asks if Kv, where v is odd (or Kv - F, if v is even), can be decomposed into 2-factors in which each factor is made either entirely of m-cycles or entirely of n-cycles. This thesis examines the case in which r of the factors are made up of cycles of length 3 and s of the factors are made up of cycles of length 9, for any r and s. We also discuss a constructive solution to the general (m,n) case which fixes r and s.