Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Hamilton-Waterloo Problem"”.

  1. 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 …

    mtu Repository record for Hamilton-Waterloo problem with triangle and C9 factors (opens in a new tab)

  2. ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16

    … tackles the challenging graph decomposition problem of finding solutions to the uniform case of the Hamilton-Waterloo Problem (HWP). The HWP seeks decompositions of complete graphs into cycles of specific lengths. Here, we focus on cases with a single factor of 6-cycles. The dissertation then …

    mtu Repository record for ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16 (opens in a new tab)

  3. Two Problems of Gerhard Ringel

    … the twentieth century. This work deals with two problems that arose from Ringel's research: the Hamilton-Waterloo Problem, and the problem of R-Sequences. The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv-F, where F is a 1-factor …

    mtu Repository record for Two Problems of Gerhard Ringel (opens in a new tab)