Recoloring subgraphs of \(K_{2n}\) for sports scheduling

DOI10.1016/j.tcs.2021.03.029OpenAlexW3140071015MaRDI QIDQ2034794

Sebastián Urrutia, Tiago Januario, Dominique de Werra

Publication date: 23 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.03.029

zbMATH Keywords

graph theoryone-factorizationsubgraph recoloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

In memory of Jérôme Monnot

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge coloring: a natural model for sports scheduling
• Sports scheduling search space connectivity: a riffle shuffle driven approach
• Switching in one-factorisations of complete graphs
• Geography, games and graphs
• Edge colorings of \(K_{2n}\) with a prescribed condition. I
• On embedding incomplete symmetric Latin squares
• Constructing timetables for sport competitions
• Scheduling in Sports
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• PERFECT 1-FACTORISATIONS OF

This page was built for publication: Recoloring subgraphs of \(K_{2n}\) for sports scheduling