Map Coloring Vertex Drawing Txt: mini excursion 2 (p. 318-330 ) & SOL: DM.1 Classwork Project Assigned due in two blocks (print the rubric at the end of.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics and Its Applications
Advertisements

Vertex-Edge Graphs.
ROUND ROBIN SCHEDULING BY NAGA SAI HANUMAN.POTTI.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.
How many non-isomorphic tournaments with 10 vertices are there? a). 5 b). 10 c). 362,880 d). Over nine million.
Coloring Graphs This handout: Coloring maps and graphs
New Algorithm DOM for Graph Coloring by Domination Covering
Engineering 1182 College of Engineering Engineering Education Innovation Center Missing Lines Section of Text.
Chapter 4 Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 4, Monday, September 8.
Graph Coloring.
April 22, Tonight’s Homework Angles Workbook Page 10 Skip #13.
Chapter 9.8 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.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Planar Graphs Graph Coloring
Chapter 10.8 Graph Coloring
Sec. 5.1: Planarity & Coloring
Graph.
Graph Theory Introducton.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.1, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Section 8.5. In fact, all of the equations can be converted into one standard equation.
Directed Graphs AZ Standard Use directed graphs to solve problems.
Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:
EULER PATHS & CHINESE POSTMAN SOL: DM.2 CLASSWORK WORKSHEET HOMEWORK (DAY 59) WORKSHEET.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
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.
Classwork Quiz Worksheet Homework (day 54) Worksheet (1-7) Walks, Paths and Circuits SOL: DM.1.
Critical Path Scheduling (Txt: 8.5 & SOL: DM.10) CLASSWORK (DAY 30) EXAMPLE IN CLASS HOMEWORK (DAY 30): WORKSHEET DAY 30 QUIZ NEXT BLOCK.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Graphing Linear Equations
Graph Coloring Lots of application – be it mapping routes, coloring graphs, building redundant systems, mapping genes, looking at traffic patterns (see.
5-4 Writing Equations in Slope-Intercept Form
Basic Concepts Graphs For more notes and topics visit:
2.3 Graph Coloring Homework (MATH 310#3W):
What is the next line of the proof?
Hamilton Paths & Hamilton Circuits SOL: DM.2
Can you draw this picture without lifting up your pen/pencil?
Graph Theory Graph Colorings.
Chapter 10.8 Graph Coloring
Math Review Equations 1. Solve for x. Explain each step in a proof. Graphing Equations 2. Graph the following equation. Angle Relationships 3. Angles 1.
Ways to show a function Four ways to display/write a function
Coloring Graphs This handout: Coloring maps and graphs
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
Graph Theory By Amy C. and John M..
10.1 Graphs and Graph Models
Representing Relations
Graph Theory What is a graph?.
Graph Coloring.
Nearest Neighbor Repetitive Nearest Neighbor (Unit 10) SOL: DM.2
Graphs By Rajanikanth B.
Chapter 10.8 Graph Coloring
Warm-up Write the equation of an ellipse centered at (0,0) with major axis length of 10 and minor axis length Write equation of a hyperbola centered.
Critical Path Scheduling (Txt: 8.5 & SOL: DM.10)
Classwork Worksheet Homework (day 67) worksheet
CHAPTER 15 Graph Theory.
Central Angles and Arcs
Graph Linear Inequalities in Two Variables
Ch. 9: Graph Theory 9.1 Intro to Graphs.
Scheduling SOL: DM.1 Classwork
Functions and Relations
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Prof. Ramin Zabih Graph Traversal Prof. Ramin Zabih
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

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 the power point slide) Apply the Four Color Theorem to one of the graphs Homework (day 52) worksheet

A Graph is a collection of points (or circles) some of which are joined by lines or curves. These are called “vertices” and “edges.” The word node is sometimes used instead of “vertex”; the word arc is sometimes used in place of “edge.” Each edge joins two different vertices. A given pair of vertices may or may not be joined by an edge. Coloring of a Map involved assigning colors to the countries of a map so that Countries with a common border are assigned different colors. “Coloring of a graph” involves assigning colors to the vertices of a graph so that adjacent vertices are assigned different colors.

Map Coloring A “coloring of a map” involves assigning colors to the countries of a map so that countries with a common border are assigned different colors. Vertex coloring of graphs can be used to solve a variety of problems which involve “conflict.” In a situation involving maps, two countries are in conflicting if they share the same border. We resolve the conflict by assigning conflicting countries different colors. In a situation involving class projects, two projects are in conflict if they share the same member. We resolve the conflict by assigning conflicting projects different meeting times. Edge colorings of graph can be used to schedule tournaments, especially round robin.

“The Story of the Young Map Color-er”