\" \'iye\' es.aspx : test d : 199/629098centerwinsyes 110% FSC-MTH107-J01-Fall20

Question

" 'iye' es.aspx : test d : 199/629098centerwinsyes 110% FSC-MTH107-J01-Fall2017 Test: Module 4 Examination Time Limit: 01:15:00 Submit Tes This Question: 10 pts 2 of 10 (9 complete) This Test: 100 pts possibl The graph to the right represents a map of the states North Dakota, South Dakota, Nebraska, Kansas, Oklahoma, Arkansas, Missouri, lowa, Minnesota, Wisconsin, and linois. Two vertices are joined by an edge if anad only if the states share a stretch of common border. Find the smallest number of colors that can be used to color the map s0 that any two states sharing a stretch of common border are not colored with the same color. SD NE KS IL. MO OK AR The smallest number of colors that can be used to color the map whose graph is shown is Type a whole number.) Enter your answer in the answer box and tehome pgup pgdn end

Explanation / Answer

The chromatic number of a graph G is the smallest number of color needed to color the vertices so that no two adjacent vertices share the same color

The smallest number of colors that can be used to color the map is 3

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

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