Use words to describe solution process. No programming.
Mathematics Homework Solutions
#30492
Chromatic Number; Planar
Use words to describe the solution process. No programming.
2. Let G = (V,E) be a graph where V {1,2,3,4,5,6,7,8,9,10,11,12} and E contains all edges connecting to vertices a and b such that ab=0 (mod 3). What is the chromatic number of G? Is G planar?
This shows how to find the chromatic number.
What is this?
By OTA - Overall OTA Rating
Changping Wang, MA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$19.95)
Included in Download
- Plain text response
- Attached file(s):
- discrete2.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Planar graph - I need to show that if G is a planar graph, then G must have a vertex of degree at most 5.
- Prove : If G is a planar graph with n vertices, m edges and r regions , then n-m+r=1+k(G). - Prove : If G is a planar graph with n vertices, m edges and r regions , then n-m+r=1+k(G). K(G) is the number of component. Can you explain what is n-cube Qn and explain it step by step?
- Show that every planar graph of order n>=4 has at least four vertices of degree less than or equal to 5. - Show that every planar graph of order n>=4 has at least four vertices of degree less than or equal to 5.
- Discrete Mathematics : Prove that a 5-regular graph with 10 vertices is nonplanar. - Let G be a 5-regular graph with ten vertices. Prove that G is nonplanar.
- Planar Graph - Prove that the complete graph K5 is nonplanar.
