Purchase Solution

# Graphs : Coloring Maps

Not what you're looking for?

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).]

##### 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.

##### 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 provided by:
###### Education
• B.Com, University of Ajmer
• M.Com, University of Ajmer
###### Recent Feedback
• "Great work!!!! Thank you"
• "Excellent!"
• "Really help!!!thank you."
• "Thanks for answering my question!!"
• "thank you. great guidance."

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.