Graph Coloring Section 6.4. 6.4 Graph Coloring 2 Color the counties in this map (White is not a color)

Slides:



Advertisements
Similar presentations
Orientation for New Regional Directors Official presentation of the Student National Medical Association Board-approved April 2006.
Advertisements

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
The Four Color Theorem (4CT)
1 Simon Kemp, Neil Smith, Julia Kendal, Joshua Davies University of Southampton Institutional Blackout: engaging staff and students in saving energy.
13.4 Map Coloring and the Four Color Theorem. We started this chapter by coloring the regions formed by a set of circles in the plane. But when do we.
By: Megan Duke Jason Holman Eli Morris Aaron Wagner.
From Coloring Maps to Avoiding Conflicts Nathaniel Dean, Robert M. Nehs, and Tong Wu Department of Mathematical Sciences Texas Southern University 3100.
David Laughon CS594 Graph Theory Graph Coloring. Coloring – Assignment of labels to vertices k-coloring – a coloring where Proper k-coloring – k-coloring.
“Coloring in Math Class” Julie March Tracey Clancy Onondaga Community College.
2012 AP & IB Exam Schedule Monday April 30 Tuesday May 1 Wednesday May 2 Thursday May 3 Friday May 4 NO EXAMS 8:30 AM – 10:30 AM IB English (Library) 8:30.
E ULERIZING G RAPHS Notes 25 - Section 5.7. E SSENTIAL L EARNINGS Students will understand and be able to use Eulerization to find optimal exhaustive.
QUESTION 1 What day is it today? A) I’m Tuesday. B) I have Tuesday. C) Tuesday. D) It’s Tuesday.
Coloring Graphs This handout: Coloring maps and graphs
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graph Theory and Graph Coloring Lindsay Mullen
Graph Coloring.
CS 2813 Discrete Structures
9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.
Spring 2015 Mathematics in Management Science Conflict Scheduling Vertex Coloring Chromatic Number Conflict Resolution.
Graph Coloring.
Warm up Problem Color the map at the right with as few colors as possible so that adjacent regions are not the same color. What do you think is the fewest.
Second Year Student Meeting PhD Candidacy Exam. Off-topic candidacy exam General GSBS Procedure - some programs vary Three off-topic summaries -usually.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
More Graphs, Subgraphs and Trees Planarity and Coloring.
New Leader Training – National By-Laws Directors Director of Communications The Director of Communication shall assist the Secretary in maintaining open,
Modeling Using Colorability Presented by: Kelley Louie CSC 252 Algorithms 252a-aj.
Chapter 10 Section 2 Political Party Organization.
AP® helps you earn college credit and stand out in the college admissions process College-level classes, taught in high school Rigorous national collegiate.
1 Graph Coloring: An Overview Graph Coloring Basics Planar/4-color Graphs Applications New Register Allocation Technique.
Aim: What does map coloring have to do with Graph theory?
Vertex Coloring Chromatic Number Conflict Resolution
Village Charter Academy Parent Meeting August 29, 2014.
College of Architecture Architecture Interior Design.
Chapter 10.8 Graph Coloring
5.3 – Solving Multi-Step Inequalities. *Just like solving equations*
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.1, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
National Journal Presentation Credits Producers: Katharine Conlon Director: Jessica Guzik Senate Committee Maps Updated: January 15, 2015.
This week’s lessons are designed to reinforce the content standards of: Click the mouse for the next screen.
Societies Guild GM 14 th January Welcome Committee Reports.
Combinatorics Ramsey theory.  a precocious British mathematician, philosopher and economist  a problem in mathematical logic: can one always find order.
6.8 Million people, or 2.4 percent reported more than one race. The Two or More Races Population: 2000 The Two or More Races Population: 2000.
National Honor Society April Hawkins-King Chapter Purpose: The purpose of this organization shall be to create enthusiasm for scholarship, to stimulate.
Chapter 10.8 Graph Coloring These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7 th ed., by Kenneth.
FOUR COLOR THEOREM BY: JUSTIN GILMORE. FOUR COLOR THEOREM The four-color theorem states that any map in a plane can be colored using four-colors in such.
Welcome! Cinda Heeren Lecturer Department of CS UIUC The Beauty of Computer Science.
Community Leagues In Wyndham. Observations  Proliferation of “two team” cricket clubs with no desire to work together to grow a community club.  Different.
IN PARTNERSHIP WITH THE PEW CHARITABLE TRUSTS CHILDREN’S DENTAL CAMPAIGN Dental Access Project Moving forward for those in need of dental care Amy Zaagman.
Map Coloring Vertex Drawing Txt: mini excursion 2 (p ) & SOL: DM.1 Classwork Project Assigned due in two blocks (print the rubric at the end of.
Societies Guild GM 25 th February Welcome Shout Out!
National Journal Presentation Credits Producers: Katharine Conlon Director: Afzal Bari House Committee Maps Updated: March 19, 2015.
Presented By Ravindra Babu, Pentyala.  Real World Problem  What is Coloring  Planar Graphs  Vertex Coloring  Edge Coloring  NP Hard Problem  Problem.
Graph Coloring.
The Beauty of Computer Science
By Harish Bhattarai, Cameron Halvey, Layton Miller
What is the next line of the proof?
Relations and Functions
Graph Theory Unit 2.
Graph Theory Graph Colorings.
Graphing Points COURSE 3 LESSON 3-1
Chapter 10.8 Graph Coloring
Coloring Graphs This handout: Coloring maps and graphs
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
Graph Coloring.
Sampling Distribution of a Sample Mean
(map is coded by CAE-CD region)
CSE 6408 Advanced Algorithms.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 10.8 Graph Coloring
Presentation transcript:

Graph Coloring Section 6.4

6.4 Graph Coloring 2 Color the counties in this map (White is not a color)

6.4 Graph Coloring 3 How many colors did you use?

6.4 Graph Coloring 4

5 How many colors did you use?

6.4 Graph Coloring 6 Two rules for coloring 1. 2.

6.4 Graph Coloring 7 Color each map

6.4 Graph Coloring 8 Draw a map that requires 5 colors Example 5 colors

6.4 Graph Coloring 9 The Color Theorem Any map can be colored with. or fewer colors Guthrie et al

6.4 Graph Coloring 10 Color The Vertices A G F C E D B A GF C E D B Graph Theory Lesson 8raph Theory Lesson 8

6.4 Graph Coloring 11 You do one WA NV OR TX UT NM CO AZ CA WA OR NV UT NM CO AZ CA TX

6.4 Graph Coloring 12 Geometry and Graphs 1.If a graph contains a, the graph requires at least 3 colors 2.If a graph contains a, the graph requires at least 4 colors 3.If a graph contains a, the graph requires at least 5 colors Cartoon

6.4 Graph Coloring 13 “Student Council Committees” A student council consists of 7 students a, b, c, d, e, f, g. Each student belongs to several of 6 committees These committees meet weekly for an hour at the same time (noon). All members must be present before business can be conducted. There are lots of meeting rooms available. What is the fewest number of days required to schedule all 6 committees? Executive (E) = {a, b, c} Ways/Means (W) = {b, d, e} Finance (F) = {a, b, d} By-Laws (B) = {a, c, g} Social (S) = {e, f} Recruiting (R) = {c, e, f, g}

6.4 Graph Coloring 14 MTWTHF What meetings should be scheduled on which days so that no conflicts arise? Executive (E) = {a, b, c} Ways/Means (W) = {b, d, e} Finance (F) = {a, b, d} By-Laws (B) = {a, c, g} Social (S) = {e, f} Recruiting (R) = {c, e, f, g}

6.4 Graph Coloring 15 Executive (E) = {a, b, c, f, h} Finance (F) = {a, b, d, e} Social (S) = {c, e, f} Ways and Means (W) = {b, d, e, g, h} By-Laws (B) = {a, c, g} Recruiting (R) = {c, e, f, g} Sports (SP) = {a, b, c} Coordinating (C) = {a, b, d, g} Academic (A) = {b, e, f, h} Newsletter (N) = {b, d, e, h} Outreach (O) = {a, c, g} Fund-raising (FR) = {a, c, e, f, g}

6.4 Graph Coloring Vertices = Parties. 4-Step Algorithm Executive (E) = {a, b, c} Finance (F) = {a, b, d} Social (S) = {e, f} Ways/Means (W) = {b, d, e} By-Laws (B) = {a, c, g} Recruiting (R) = {c, e, f, g} Exec Recru SocBy-Laws WM Fin 2. Edges join parties 3. Color the vertices 4. # colors = # days required MTW ThF

6.4 Graph Coloring 17 “Final Exams” A school has six graduating seniors: Adams (A), Black (B), Courtois (C), D’Amico (D), Epstein (E), and Flaherty (F) You must prepare a final exam schedule for these students. Students can take only one exam each day What is the fewest number of days required to schedule all 8 exams? A:English, Science, PoliticsD:English, French, Art B:Science, Politics, PhilosophyE:Politics, Art, Philosophy C:Math, Philosophy, ArtF:Math, Science, Music

6.4 Graph Coloring 18 A:English, Science, PoliticsD:English, French, Art B:Science, Politics, PhilosophyE:Politics, Art, Philosophy C:Math, Philosophy, ArtF:Math, Science, Music

6.4 Graph Coloring 19 How many days are required?

6.4 Graph Coloring 20 A:English, Science, PoliticsD:English, French, Art B:Science, Politics, PhilosophyE:Politics, Art, Philosophy C:Math, Philosophy, ArtF:Math, Science, Music G:Music, PhilosophyH:Science, French

6.4 Graph Coloring 21 If G is added how many days are required?

6.4 Graph Coloring 22 If both G and H are added how many days are required?

6.4 Graph Coloring 23 “Desperate Housewives” You owe party invitations to several sets of friends: Browns, Caldwells, Fortins, Grandes, Martens, Nevins, and Princes. Three nights (Thursday, Friday, and Saturday) are available However, you know that it would make for a happier time for all if several of the couples were not to come on the same night Can you schedule all of your friends on the three nights?

6.4 Graph Coloring 24 Nevins don’t get along with Browns or Fortins Martins usually argue politics with Nevins Princes and Grandes are in-laws whose kids are fighting Prince just sued Brown and Fortin Caldwell and Martin are spiteful business competitors One of the Browns is having an affair with one of the Caldwells Fortin’s owe the Grandes a considerable amount of money

6.4 Graph Coloring 25 How many nights are necessary? Nevins don’t get along with Browns or Fortins Martins usually argue politics with Nevins Princes and Grandes are in-laws whose kids are fighting Prince just sued Brown and Fortin Caldwell and Martin are spiteful business competitors One of the Browns is having an affair with one of the Caldwells Fortin’s owe the Grandes a considerable amount of money

6.4 Graph Coloring 26 One more complication Nevins don’t get along with Browns or Fortins Martins usually argue politics with Nevins Princes and Grandes are in-laws whose kids are fighting Prince just sued Brown and Fortin Caldwell and Martin are spiteful business competitors One of the Browns is having an affair with one of the Caldwells Fortin’s owe the Grandes a considerable amount of money Browns had a long-standing feud with both the Fortins and the Grandes?

End of 6.4

6.4 Graph Coloring 28 Francis Guthrie

6.4 Graph Coloring 29 Wolfgang Haken and Kenneth Appel

6.4 Graph Coloring 30 Scheduling Conflicts Oh, What to do? What to Dooooo?

6.4 Graph Coloring 31 Ex. 1 Contradiction to the Four-Color Problem? ? Solution

Meta - Material