Explore BrainMass

Explore BrainMass

    Graphs : Coloring Maps

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Show that a planar map M = M(G) can be 2 colored iff every vertex of G has even degree.

    [The map M(G) of a graph G is the collection of its faces, which are to be colored so that no adjacent faces have the same color.]

    [hint: if every vertex of G has even degree then G is a union of edge-disjoint cycles. for another solution, apply induction on the number of edges, and delete the edges of a cycle forming the boundry of a face of M(G).]

    © BrainMass Inc. brainmass.com March 4, 2021, 8:17 pm ad1c9bdddf

    Solution Preview

    Please see the attached file for the complete solution.
    Thanks for using BrainMass.

    Proof : Let G we any graph of 2 face colourable. Then dual graph of G., i.e. G* having chromatic number ...

    Solution Summary

    Colored maps are investigated. The solution is detailed and well presented. The response was given a rating of "5/5" by the student who originally posted the question.