Constructing day-balanced round-robin tournaments with partitions (Q1682881): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.09.005 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2764289176 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2764289176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply balanced edge colorings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of strength groups in round robin tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing fair sports league schedules with regard to strength groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising common fixtures in a round robin tournament with two divisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Particular Conference Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of sports schedules with multiple venues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of balanced sports schedules using partitions into subleagues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete regular s-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659803 / rank
 
Normal rank

Latest revision as of 20:30, 14 July 2024

scientific article
Language Label Description Also known as
English
Constructing day-balanced round-robin tournaments with partitions
scientific article

    Statements

    Constructing day-balanced round-robin tournaments with partitions (English)
    0 references
    6 December 2017
    0 references
    0 references
    sports scheduling
    0 references
    balanced tournament
    0 references
    tournament with partitions
    0 references
    tournament with a bye
    0 references
    fair (holey) 1-factorization
    0 references
    0 references