<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>On the Hamilton-Waterloo Problem with a single factor of 6-cycles</dc:title><dc:creator>Santizo Huerta,	Zazil	(Avtor)
	</dc:creator><dc:creator>Keranen,	Melissa	(Avtor)
	</dc:creator><dc:subject>2-factorizations</dc:subject><dc:subject>Hamilton-Waterloo problem</dc:subject><dc:subject>Oberwolfach problem</dc:subject><dc:subject>cycle decomposition</dc:subject><dc:subject>resolvable decompositions</dc:subject><dc:description>The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable (CM, CN)-decomposition of Kv into α CM-factors and β CN-factors. We denote a solution to the uniform Hamilton-Waterloo problem by HWP(v; M, N; α, β). Our research concentrates on addressing some of the remaining unresolved cases, which pose a significant challenge to generalize. We place a particular emphasis on instances where the gcd (M, N) = {2, 3}, with a specific focus on the parameter M = 6. We introduce modifications to some known structures, and develop new approaches to resolving these outstanding challenges in the construction of uniform 2-factorizations. This innovative method not only extends the scope of solved cases, but also contributes to a deeper understanding of the complexity involved in solving the Hamilton-Waterloo Problem.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2026</dc:date><dc:date>2026-08-11 11:35:59</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>23442</dc:identifier><dc:identifier>UDK: 51</dc:identifier><dc:identifier>eISSN: 1855-3974</dc:identifier><dc:identifier>DOI: 10.26493/1855-3974.3316.6d0</dc:identifier><dc:language>sl</dc:language></metadata>
