The purpose of this paper is to present the problem of scheduling the games of a hockey or football league. It is shown how a graph theoretical model may be used and how some constraints related to… Expand

Abstract Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets… Expand

We show that an equitable edge-colouring of a graph G is equitable if, for each vertex v of G, the number of edges of any one colour incident with v differs from any other colour incident by at most one.Expand

Graph-theoretical models are given for constructing the season schedule of a sports league with a regular alternation of home-games and away-games.Expand

A graph is called “perfectly orderable” if its vertices can be ordered in such a way that, for each induced subgraph F, a certain "greedy" coloring heuristic delivers an optimal coloring of F.Expand

Suppose we are given a finite set E, a family F of 'feasible' subsets of E and a real weight c(e) associated with every [email protected] We consider the problem of finding [email protected] for… Expand