Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length

Let Kn+I denote the complete graph of even order with a 1‐factor duplicated. The spouse‐loving variant of the Oberwolfach Problem, denoted OP+(m1,m2,…,mt), asks for the existence of a 2‐factorization of Kn+I in which each 2‐factor consists of cycles of length mi, for all i,1≤i≤t, such that n=m1+m2+⋯...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial designs 2021-02, Vol.29 (2), p.114-124
Hauptverfasser:	Shanmuga Vadivu, Andiyappan, Panneerselvam, Lakshmanan, Muthusamy, Appu
Format:	Artikel
Sprache:	eng
Schlagworte:	2‐factorization complete graph plus a 1‐factor Completeness Integers spouse‐loving variant of the Oberwolfach problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!