Equitable Colourings Of D-Degenerate Graphs


In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this… (More)
DOI: 10.1017/S0963548302005485


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics