The tournament scheduling problem with absences

We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a certain number t of absences. We then examine how many rounds are needed to schedule the whole tournament in the worst case. This upper limit depends on t and on the structure of the graph G whose edges represent the games that have to be played, but also on whether or not the absences are announced before the tournament starts. Therefore, we actually have two upper limits for the number of required rounds. We have χ^t(G) for pre-scheduling if all absences are pre-fixed, and we have χOLt(G) for on-line scheduling if we have to stay flexible and deal with absences when they occur. We conjecture that ^χt(G)=Δ(G)+2t and that χOLt(G)=^χ′(G)+2t. The first conjecture is stronger than the Total Coloring Conjecture while the second is weaker than the On-Line List Edge Coloring Conjecture. Our conjectures hold for all bipartite graphs. For complete graphs, we prove them partially. Lower and upper bounds to χ^t(G) and χOLt(G) for general multigraphs G are established, too.