Activity 6 Coloring Two Graphs What is the smallest number of colors needed for

Question

Activity 6 Coloring Two Graphs What is the smallest number of colors needed for a coloring of each of the following two graphs? (Several copies are provided of each graph) Remember you have two number of colors needed for each graph, and explain why you can't color each graph using tasks-find the smallest fewer ote that these graphs are similar to the graph in Activity 5. In the graph on the left, the Activity 5's graph has been reflected along its bottom border, and in the graph on the right, the top two vertices in Activity 5's graph have been pinched together into one vertex which essentially eliminates two edges. Can you identify these edges? What is the smallest number of colors needed to color the graph at the lef ? Why can't you color it using one fewer color? What is the smallest number of colors needed to color the graph at the right? Why can't you color it using one fewer color?

Explanation / Answer

Minimum number of colours required to coloured on left side of a graph is 6 because the maximum number of sides added to the point is 6

Minimum number of colours required to coloured on right side of a graph is 3 because the maximum number of sides added to the point is 3

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.