Share
Explore BrainMass

outerplannar graph

Use the four color theorem to prove that every outerplanar graph is 3-colorable.

Solution Summary

The coloring of the vertices is assessed.

$2.19