The Hamilton-Waterloo problem with C₄ and C_m factors

From MaRDI portal
Publication:501060

DOI10.1016/J.DISC.2015.08.013zbMATH Open1322.05116arXiv1505.08121OpenAlexW1487692996MaRDI QIDQ501060FDOQ501060


Authors: Uğur Odabaşı, Sibel Özkan Edit this on Wikidata


Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The Hamilton-Waterloo problem with uniform cycle sizes asks for a 2 factorization of the complete graph Kv (for odd {em v}) or Kv minus a 1factor (for even {em v}) where r of the factors consist of ncycles and s of the factors consist of mcycles with r+s=leftlfloorfracv12ightfloor. In this paper, the Hamilton-Waterloo Problem with 4cycle and mcycle factors for odd mgeq3 is studied and all possible solutions with a few possible exceptions are determined.


Full work available at URL: https://arxiv.org/abs/1505.08121




Recommendations




Cites Work


Cited In (19)





This page was built for publication: The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501060)