Scribd Logo
Upload

Welcome to Scribd!

  • Coloring Discussion 2021

    Uploaded by

    Hospital Basis
    14 views4 pages
    This document discusses three graph coloring problems: 1) Determining the earliest time that eight students can finish makeup exams for four time periods if two exams cannot be given at the same time and students are taking various courses. 2) Finding the minimum number of traffic signal phases needed to safely handle an intersection if cars from lanes that could collide are not allowed in the intersection at the same time. 3) Finding the chromatic index of given graphs, which is the minimum number of colors needed to color the edges of each graph so that no two adjacent edges share the same color.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses three graph coloring problems: 1) Determining the earliest time that eight students can finish makeup exams for four time periods if two exams cannot be given at the same time and students are taking various courses. 2) Finding the minimum number of traffic signal phases needed to safely handle an intersection if cars from lanes that could collide are not allowed in the intersection at the same time. 3) Finding the chromatic index of given graphs, which is the minimum number of colors needed to color the edges of each graph so that no two adjacent edges share the same color.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    14 views4 pages

    Coloring Discussion 2021

    Uploaded by

    Hospital Basis
    This document discusses three graph coloring problems: 1) Determining the earliest time that eight students can finish makeup exams for four time periods if two exams cannot be given at the same time and students are taking various courses. 2) Finding the minimum number of traffic signal phases needed to safely handle an intersection if cars from lanes that could collide are not allowed in the intersection at the same time. 3) Finding the chromatic index of given graphs, which is the minimum number of colors needed to color the edges of each graph so that no two adjacent edges share the same color.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    GRAPH

    COLORING
    DISCUSSION
    THURSDAY, 28 OCTOBER 2021
    PROBLEM 1

    • Eight mathematics majors at a small college are permitted to attend a meeting dealing with
    undergraduate research during final exam week provided they make up all the exams missed
    on the Monday after they return. The possible time periods for these exams on Monday are

    • Use graph theory to determine the earliest time on Monday that all eight students can finish
    their exams if two exams cannot be given during the same time period if some student must
    take both exams. The eight tudents and the courses [Advanced Calculus (AC), Differential
    Equations (DE), Geometry (G), Graph Theory (GT), Linear Programming (LP), Modern
    Algebra (MA), Statistics (S), Topology (T)] each student is taking are listed below:
    PROBLEM 2

    • The road intersection shown in Figure 10.14 needs a traffic signal to handle the traffic
    flow. If cars from two different lanes could collide, then cars from these two lanes will not
    be permitted to enter the intersection at the same time. What is the minimum number of
    signal phases that are needed to ensure safe traffic?
    PROBLEM 3

    • Determine the chromatic index of each graph in

    You might also like