Scheduling Five different charity organizations send trucks on various routes to pick up donations that residents leave on their doorsteps.
Charity A covers Main St., First Ave� and State St.
Charity B Covers First Ave., Second Ave., and Third Ave.
Charity C covers State St., City Dr., and Country Lane.
Charity D Covers City Dr., Second Ave� and Main St.
Charity E covers Third Ave., Country Lane, and Fourth Ave.
Each charity has its truck travel down all three streets on its route on the same day, but no two charities wish to visit the same streets on the same day. Use graph coloring to design a schedule for the charities. Arrange their pickup routes so that no street is visited twice on the same day by different charities. The schedule should use the smallest possible number of days.
Want to see the full answer?
Check out a sample textbook solutionChapter 5 Solutions
Mathematical Excursions (MindTap Course List)
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageCollege AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningAlgebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning