Graphs

Assignment

Problems from Mathematics for Computer Science (MCS). These are tentative, I will probably remove a few after working them out myself.

1. MCS Problem 12.2, but instead of 20, use (20 + your class number) % 15, rounded up if the answer is odd.
2. MCS Problem 12.12 (ungraded)
3. MCS Problem 12.23 and note that Chi(G) is the chromatic number of G - the smallest number of colors that can be used to color the vertices of the graph.
4. MCS Problem 12.25
5. MCS Problem 12.33
6. MCS Problem 12.46
7. MCS Problem 12.50