Recoloring subgraphs of \(K_{2n}\) for sports scheduling
type: Item
instance of: scholarly article
title: Recoloring subgraphs of \(K_{2n}\) for sports scheduling
author: Sebastián Urrutia
author: Dominique De Werra
author: Tiago Januario
published in: Theoretical Computer Science
publication date: 2021-06-23T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7362196
zbMATH Keywords: graph theory
zbMATH Keywords: one-factorization
zbMATH Keywords: subgraph recoloring
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.03.029
OpenAlex ID: W3140071015
cites work: Q4434227
cites work: Q5422499
cites work: On embedding incomplete symmetric Latin squares
cites work: Geography, games and graphs
cites work: Scheduling in Sports
cites work: There are 526,915,620 nonisomorphic one‐factorizations of K12
cites work: PERFECT 1-FACTORISATIONS OF
cites work: Sports scheduling search space connectivity: a riffle shuffle driven approach
cites work: Edge coloring: a natural model for sports scheduling
cites work: Switching in one-factorisations of complete graphs
cites work: Edge colorings of \(K_{2n}\) with a prescribed condition. I
cites work: Constructing timetables for sport competitions
cites work: Q4332941
DOI: 10.1016/J.TCS.2021.03.029
description: scientific article; zbMATH DE number 7362196