The exploration of one-factorizations of complete graphs is the foundation of some classical sports scheduling problems. One has to traverse the landscape of such one-factorizations by moving from one of those to a so-called neighbor one-factorization. This approach amounts to modifying locally the coloring associated with a one-factorization. We consider some particular types of modifications and describe various constructions which give one-factorizations which may be modified or not by these techniques. Among those are recoloring of bichromatic cycles, altering of optimally colored subcliques of even size, or recoloring of chordless lanterns.

中文翻译：

---

为运动安排重新着色K _{2 n 的}子图

对完全图的单因式分解的探索是一些经典体育调度问题的基础。人们必须通过从其中之一移动到所谓的邻居单因式分解来遍历这种单因式分解的景观。这种方法相当于局部修改与单因式分解相关的着色。我们考虑了一些特定类型的修改并描述了各种构造，这些构造给出了可以通过这些技术修改或不修改的单因式分解。其中包括双色循环的重新着色，改变均匀大小的最佳着色子集团，或重新着色无弦灯笼。