Graph colouring and its generalizations are useful tools in modelling a wide variety of
scheduling and assignment problems. In this paper we review several variants of graph …

Constraint satisfaction problems have enjoyed much attention since the early seventies, and
in the last decade have become also a focus of attention amongst theoreticians. Graph …

This paper presents a historical review and recent developments in mixed graph colorings in
the light of scheduling problems with the makespan criterion. A mixed graph contains both a …

We survey the literature on those variants of the {\em chromatic number\/} problem where not
only a proper coloring has to be found (ie, adjacent vertices must not receive the same color) …

This paper is the first article in a series devoted to the study of the following general problem
on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to …

For a positive integer k, ak‐coloring of a graph is a map** such that whenever. The
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …

We discuss the Precoloring Extension (PrExt) and the List Coloring (LiCol) problems for
trees, partial k-trees and cographs in the decision and the construction versions. Both …

We consider scheduling problems in a multiprocessor system with incompatible jobs (two
incompatible jobs cannot be processed by the same machine). We consider the problem to …

In this paper we consider the following time constrained scheduling problem. Given a set of
jobsJwith execution timese (j)∈(0, 1] and an undirected graphG=(J, E), we consider the …

Thomassen posed the following problem: SupposeGis a planar graph andW⊆ V (G) such
that the distance between any two vertices inWis at least 100. Can a 5-coloring ofWbe …