Combinatorics and Graph Theory · Problem 5.8.2

Graph Theory — David Guichard

Mathematics — Combinatorics · graph-coloring

Problem

Find the chromatic number of the graph below by using the algorithm in this section. Draw all of the graphs G+eG + e and G/eG/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 with 5 vertices]\text{[graph figure with 5 vertices]}

Related theory

Browse the problem library