The field of graph colouring is an area of discrete mathematics which gives operation research scientists the ability to classify components of a set within given constraints which are generated as a graph. By identifying more than 200 unsolved problems, this text shows a central aspect of discrete mathematics in a new perspective and creates challenges for its readers. Information is also provided on related results and the reference literature.

Linear programming is a form of optimization which is a method used in discrete mathematics to solve complex real-life problems, such as the best way to connect 100 cities by telephone cables.