On the spouse‐loving variant of the Oberwolfach problem

2019 ◽  
Vol 27 (4) ◽  
pp. 251-260
Author(s):  
Noah Bolohan ◽  
Iona Buchanan ◽  
Andrea Burgess ◽  
Mateja Šajna ◽  
Ryan Van Snick
Keyword(s):  
Oberwolfach Problem

scholarly journals The generalised Oberwolfach problem

2022 ◽  
Vol 152 ◽  
pp. 281-318
Author(s):  
Peter Keevash ◽  
Katherine Staden
Keyword(s):  
Oberwolfach Problem

scholarly journals From graceful labellings of paths to cyclic solutions of the Oberwolfach problem

2009 ◽  
Vol 309 (14) ◽  
pp. 4877-4882 ◽  
Author(s):  
M.A. Ollis ◽  
Ambrose D. Sterr
Keyword(s):  
Oberwolfach Problem

scholarly journals Graph Products and New Solutions to Oberwolfach Problems

10.37236/539 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Gloria Rinaldi ◽  
Tommaso Traetta
Keyword(s):  
Regular Graph ◽  
Regular Graphs ◽  
Graph Products ◽  
Simple Graphs ◽  
Oberwolfach Problem

We introduce the circle product, a method to construct simple graphs starting from known ones. The circle product can be applied in many different situations and when applied to regular graphs and to their decompositions, a new regular graph is obtained together with a new decomposition. In this paper we show how it can be used to construct infinitely many new solutions to the Oberwolfach problem, in both the classic and the equipartite case.

scholarly journals On factorisations of complete graphs into circulant graphs and the Oberwolfach problem

2015 ◽  
Vol 11 (1) ◽  
pp. 157-173 ◽  
Author(s):  
Brian Alspach ◽  
Darryn Bryant ◽  
Daniel Horsley ◽  
Barbara Maenhaut ◽  
Victor Scharaschkin
Keyword(s):  
Complete Graphs ◽  
Circulant Graphs ◽  
Oberwolfach Problem

scholarly journals Resolution of the Oberwolfach problem

2021 ◽  
Author(s):  
Stefan Glock ◽  
Felix Joos ◽  
Jaehoon Kim ◽  
Daniela Kühn ◽  
Deryk Osthus
Keyword(s):  
Oberwolfach Problem

scholarly journals On a variation of the Oberwolfach problem

1979 ◽  
Vol 27 (3) ◽  
pp. 261-277 ◽  
Author(s):  
Charlotte Huang ◽  
Anton Kotzig ◽  
Alexander Rosa
Keyword(s):  
Oberwolfach Problem

On bipartite 2-factorizations of kn − I and the Oberwolfach problem

2010 ◽  
Vol 68 (1) ◽  
pp. 22-37 ◽  
Author(s):  
Darryn Bryant ◽  
Peter Danziger
Keyword(s):  
Oberwolfach Problem

SOME RESULTS ON THE OBERWOLFACH PROBLEM

2001 ◽  
Vol 64 (3) ◽  
pp. 513-522 ◽  
Author(s):  
A. J. W. HILTON ◽  
MATTHEW JOHNSON
Keyword(s):  
New Technique ◽  
Oberwolfach Problem

The well-known Oberwolfach problem is to show that it is possible to 2-factorize Kn (n odd) or Kn less a 1-factor (n even) into predetermined 2-factors, all isomorphic to each other; a few exceptional cases where it is not possible are known. A completely new technique is introduced that enables it to be shown that there is a solution when each 2-factor consists of k r-cycles and one (n−kr)-cycle for all n [ges ] 6kr−1. Solutions are also given (with three exceptions) for all possible values of n when there is one r-cycle, 3 [les ] r [les ] 9, and one (n−r)-cycle, or when there are two r-cycles, 3 [les ] r [les ] 4, and one (n−2r)-cycle.

Sign in / Sign up

Export Citation Format

Share Document