Edge coloring: a natural model for sports scheduling
DOI10.1016/J.EJOR.2016.03.038zbMATH Open1346.90354OpenAlexW2319512044MaRDI QIDQ323273FDOQ323273
Authors: Tiago Januario, Sebastián Urrutia, Dominique De Werra, Celso C. Ribeiro 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.038
Recommendations
- On the application of graph colouring techniques in round-robin sports scheduling
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Interval edge-coloring: A model of curriculum scheduling
- Some models of graphs for scheduling sports competitions
- An application of edge coloring of graphs to a class scheduling problem
- A tutorial on graph models for scheduling round‐robin sports tournaments
- Extensions of coloring models for scheduling purposes
- Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
- Restricted coloring models for timetabling
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- On the application of graph colouring techniques in round-robin sports scheduling
- The traveling tournament problem with predefined venues
- Scheduling in Sports
- Title not available (Why is that?)
- Sports scheduling: problems and applications
- Complexity of the traveling tournament problem
- Scheduling in sports: an annotated bibliography
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- Computer science today. Recent trends and developments
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Geography, games and graphs
- A constructive proof of Vizing's theorem
- A new neighborhood structure for round robin scheduling problems
- An ILS heuristic for the traveling tournament problem with predefined venues
- Round robin scheduling -- a survey
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Sports tournaments, home-away assignments, and the break minimization problem
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- A perfect one-factorization ofK52
- Title not available (Why is that?)
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- Title not available (Why is that?)
- Feasibility of home-away-pattern sets for round robin tournaments
Cited In (15)
- On the application of graph colouring techniques in round-robin sports scheduling
- Scheduling an exciting set of rugby matches
- The sport teams grouping problem
- Interval edge-coloring: A model of curriculum scheduling
- Handling fairness issues in time-relaxed tournaments with availability constraints
- Two-coloring triples such that in each color class every element is missed at least once
- Round-robin tournaments generated by the circle method have maximum carry-over
- The tournament scheduling problem with absences
- Total coloring and total matching: polyhedra and facets
- Round-robin tournaments generated by the circle method have maximum carry-over
- Some models of graphs for scheduling sports competitions
- A quest for a fair schedule: the international Young Physicists' Tournament
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Integrated break and carryover effect minimization
- Determining the results of tournament games using complete graphs generation
This page was built for publication: Edge coloring: a natural model for sports scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323273)
