Guichard-Combinatorics-Graph-Theory · Problem 5.8.2
Graph Theory
Mathematics — Probability · graph-coloring
Problem
Find the chromatic number of the graph below by using the algorithm in this section. Draw all of the graphs G+e and G/e generated by the algorithm in a ``tree structure'' with the complete graphs at the bottom, label each complete graph with its chromatic number, then propagate the values up to the original graph.
[Graph figure: 5-vertex graph]