The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
type: Item
instance of: scholarly article
title: The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
zbMATH Open document ID: 1066.05109
author: Roman Nedela
author: Peter Horák
author: Alexander Rosa
published in: Discrete Mathematics
publication date: 2004-08-20T00:00:00Z
review text: The Hamilton-Waterloo problem asks for a 2-factorization of the complete graph \(K_{2n+1}\) where \(r\) of the factors are isomorphic to a given 2-factor \(Q\), and \(s\) of the factors are isomorphic to a given 2-factor \(R\). The present paper deals with the version where \(Q\) is a Hamiltonian cycle, and \(R\) is the disjoint union of triangles.
reviewed by: Erich Prisner
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2093779
zbMATH Keywords: 2-Factorizations
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.031
OpenAlex ID: W1968128554
cites work: On the Hamilton-Waterloo problem
cites work: Q4873725
cites work: The Oberwolfach problem and factors of uniform odd length cycles
cites work: Bi-embeddings of the projective space PG(3, 2)
cites work: Q3998644
cites work: Q3745851
cites work: Q4697573
cites work: Two-factorizations of small complete graphs
cites work: On the Oberwolfach problem for complete multigraphs
cites work: On a variation of the Oberwolfach problem
cites work: The solution of the bipartite analogue of the Oberwolfach problem
cites work: Q3480046
DOI: 10.1016/J.DISC.2003.11.031
description: scientific article; zbMATH DE number 2093779