Study guides, Class notes & Summaries

This document talks about: - Graph Colouring: A way of assigning colours to the vertices or edges of a graph so that adjacent elements have different colours. The chromatic number of a graph is the minimum number of colours needed for a proper colouring. - Bounds and Algorithms: Some results and methods for finding upper and lower bounds on the chromatic number of a graph, such as Brooks' theorem, the greedy algorithm, and Mycielski's construction. Also, some techniques for counting the nu...

The doc for service report