Color These Maps with Four Colors

Slides:



Advertisements
Similar presentations
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Advertisements

Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Introduction to Graphs
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
2.6 Proving Angles Congruent
The Seven Bridges Of Konigsberg.
Konigsberg Bridge Problem
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
+ Graph Theory to the Rescue Using graph theory to solve games and problems Dr. Carrie Wright University of Arizona Teacher’s Circle November 17, 2011.
Graph Colouring Lecture 20: Nov 25.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graphs and Euler cycles Let Maths take you Further…
Chapter 9.8 Graph Coloring
GRAPH Learning Outcomes Students should be able to:
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Graph Theory Topics to be covered:
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Connected Components Fun with graphs, searching, and queues.
Graphs Topic 21 " Hopefully, you've played around a bit with The Oracle of Bacon at Virginia and discovered how few steps are necessary to link just about.
By: Drew Moen. Graph Theory History Leonhard Euler - founder The Seven Bridges of Königsberg Cross every Bridge once Change the city into a graph Change.
Konigsburg Bridge Problem The Konigsberg Bridge problem is a famous mathematical problem studied by many students in geometry.
One day a guy approached us with a puzzle he has been pondering on for approximately seven years. He called this the ‘Walls and Lines Puzzle’.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.1, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Planar Graphs Lecture 10: Oct 21. This Lecture Today we will talk about planar graphs, and how to color a map using 6 colors. Planar graphs Euler’s formula.
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
A puzzle…. Does any subset of these numbers add to 50? {27, 25, 3, 12, 6, 15, 9, 30, 19, 21} Generalize the problem: S  I N = {n 1, n 2,…n k }, n i 
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
The Seven Bridges of Konigsberg (circa 1735) In Konigsberg, Germany, a river ran through the city such that in its centre was an island, and after passing.
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.2 Euler Paths, and Euler Circuits.
Section 13  Questions  Graphs. Graphs  A graph representation: –Adjacency matrix. Pros:? Cons:? –Neighbor lists. Pros:? Cons:?
Chapter 6: Graphs 6.1 Euler Circuits
Chapter 5: The Mathematics of Getting Around
M Clements Formal Network Theory. Introduction Practical problem – The Seven Bridges of Königsberg Network graphs Nodes & edges Degrees Rules/ axioms.
MCA 520: Graph Theory Instructor Neelima Gupta
Konisberg Bridges (One-way street) SOL: DM.2 Classwork Quiz/worksheet Homework (day 62) worksheet.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
STARTER: CAN YOU FIND A WAY OF CROSSING ALL THE BRIDGES EXACTLY ONCE? Here’s what this question would look like drawn as a graph.
Introduction to Graph & Network Theory Thinking About Networks: From Metabolism to the Genome to Social Conflict Summer Workshop for Teachers June 27 th.
Graph Representations
Solve the following for y.
Graph theory. Graph theory Leonard Euler (“Oiler”)
Euler Paths and Circuits
Konigsberg’s Seven Bridges
Graph Theory Graph Colorings.
Euler Paths and Circuits
This unit is all about Puzzles Games Strategy.
Graphs Chapter 13.
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.
Coloring Graphs This handout: Coloring maps and graphs
Start Finish Find the solution 42 out of out of 2200
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
3-6: Prove Theorems about Perpendicular Lines
Graph Theory What is a graph?.
Chapter 10.8 Graph Coloring
Solve the following for y.
Relations and Functions
Euler Paths and Euler Circuits
Chapter 5: Graphs & Functions
A Survey of Mathematics with Applications
5 The Mathematics of Getting Around
Presentation transcript:

Color These Maps with Four Colors Color the following natural and artificial maps so that no two adjacent areas have the same color The map-coloring problem was first mentioned in 1840 by Mobius. The 4-color conjecture was formulated in 1852 and was proved, as a theorem, in 1976, using a computer-assisted method. Nov. 2016 Maps and Graphs: Puzzles

Mazes Represented as Graphs Start Finish Dead end Start Finish Start Finish Nov. 2016 Maps and Graphs: Puzzles

The Bridges of Konigsberg Puzzle Can you walk in the city of Konigsberg in such a way that you cross each bridge once and only once (in either direction)?   Nov. 2016 Maps and Graphs: Puzzles

Solve These Two Large Mazes Start Finish Start Finish Examples of maze art Nov. 2016 Maps and Graphs: Puzzles

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.