Saturday
September 5, 2015

Homework Help: Discrete Math

Posted by yengiang on Friday, April 22, 2011 at 1:09am.

I was hoping if you could help me to solve this problem. Thank you.

A department wants to schedule final exams so that no student has more than one exam on any given day. There are 7 vertices of degrees 3,3,4,4,4,5,6 which show the courses that are being taken by more than one student, with an edge connecting two vertices if there is a student in both courses. Find a way to color the vertices of the graph with only 4 colors so that no 2 adjacent vertices have the same color and explain how to use the result to schedule the final exams.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Members