Just plot the answer given in to vertex coloring, just find the fewest number of days required to schedule the exam (which is already given) sample and reference is given below

2. A school has six irregular graduating seniors: Alan, Benjie, Corinne, Dennis, Eugene, and Ferdie. You must prepare a special final exam schedule for these students. Note: Students can take all the exams in one day but students with common subject cannot be scheduled on the same day. Given below are the names of the students and the subjects that each is currently taking up: Alan: English, Science Dennis: English, Arts Benjie: Science, Politics, Philosophy Eugene: Politics, Arts, Philosophy Corinne: Math, Philosophy, Arts Ferdie: Math, Science Draw a graph representing this problem. Using vertex coloring, find the fewest number of days required to schedule all exams. Suggest one possible schedule. (15 points) Day Subject students Sitting for the cram A TOTal Science 3( Mon + Dennis) (2) philosophy 3 ( Benjie, Eugene corinne ) 3 Arts 3 ( Dennis , Eugene , corinne ) 4 English 2( Deniss of Allon) she Schedule 5 POLITICS 2 ( Eugene d Benjie) maths 2 ( corinne / ferdie ) 6 Day 1 (science / philosophy / arts) Day 2 ( Politics / maths / English ) Alan English science Dennis English Arts Benjie science , politics phillosoph Eugene Politics Arts philosophy Corinne : moths Philosophy , Acts ferdie : math stiene Answers fewest number of day required is (spray) 2days Google vertex coloring in graph theory Vertex coloring - Geodetea Graph coloting - Warpedda noreduction to Graph Colouring . You Tube Versus culoring . Martin Thoma Intro to Graph Colorings G X ( G) = 4 Graph color Just plot the answers into Graph Coloring in Or vertex coloring in graph theory