Drawing Planar Graphs

CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 15 Graphs: Planar Graphs 1 Outline What is a Planar Graph? Euler Planar Formula Platonic Solids Five Color Theorem Kuratowski s Theorem 2 What is a Planar Graph? Definition

Solutions to Quiz 1. (a) (3 points) Vertices x and y are in the same connected component. Solution. P (x, y)

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science October 17 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised October 18, 2005, 125 minutes Solutions

A THREE AND FIVE COLOR THEOREM

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, October 1975 A THREE AND FIVE COLOR THEOREM FRANK R. BERNHART1 ABSTRACT. Let / be a face of a plane graph G. The Three and Five Color Theorem

On Two Short Proofs About List Coloring Graphs

On Two Short Proofs About List Coloring Graphs October 26, 2003 LIST COLORINGS AND CHOICE NUMBER DEF: A k list assignment, L, is an assignment of sets (called lists) to the vertices so that L(v) k, for

Solutions to In Class Problems Week 5, Wed.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science October 5 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised October 5, 2005, 1119 minutes Solutions

Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017

(1/25) MA284 : Discrete Mathematics Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017 1 Definitions 1. A graph 2. Paths and connected graphs 3. Complete graphs 4. Vertex degree

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

ASSIGNMENT 4 SOLUTIONS

MATH 71 ASSIGNMENT SOLUTIONS 1. If F : X X is a function, define f (x) to be (f f)(x), and inductively define f k (x) (f f k 1 )(x) for each integer k. (So f (x) (f f )(x) f(f(f(x))) for instance.) We

Lecture 5: Graphs. Graphs! Euler Definitions: model. Fact! Euler Again!! Planar graphs. Euler Again!!!!

Lecture 5: Graphs. Graphs! Euler Definitions: model. Fact! Euler Again!! Planar graphs. Euler Again!!!! Konigsberg bridges problem. Can you make a tour visiting each bridge exactly once? Konigsberg bridges

Discrete Mathematics I So Practice Sheet Solutions 1

Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise

HW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.

1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,

Graphs and networks Mixed exercise

Graphs and networks Mixed exercise E.g. 2 a, e and h are isomorphic. b and i are isomorphic. c and g are isomorphic. d and f are isomorphic. 3 a b i ii iii Pearson Education Ltd 208. Copying permitted

5 Graphs

5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions

Discrete Wiskunde II. Lecture 6: Planar Graphs

, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is

Line Arrangements. Applications

Computational Geometry Chapter 9 Line Arrangements 1 Line Arrangements Applications On the Agenda 2 1 Complexity of a Line Arrangement Given a set L of n lines in the plane, their arrangement A(L) is the

Course Introduction / Review of Fundamentals of Graph Theory

Course Introduction / Review of Fundamentals of Graph Theory Hiroki Sayama sayama@binghamton.edu Rise of Network Science (From Barabasi 2010) 2 Network models Many discrete parts involved Classic mean-field

Tangencies between disjoint regions in the plane

June 16, 20 Problem Definition Two nonoverlapping Jordan regions in the plane are said to touch each other or to be tangent to each other if their boundaries have precisely one point in common and their

Scheduling, Map Coloring, and Graph Coloring

Scheduling, Map Coloring, and Graph Coloring Scheduling via Graph Coloring: Final Exam Example Suppose want to schedule some ;inal exams for CS courses with following course numbers: 1007, 3137, 3157,

Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences

Section 5.3 1 Recursion Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences Previously sequences were defined using a specific formula,

Ma/CS 6b Class 11: Kuratowski and Coloring

Ma/CS 6b Class 11: Kuratowski and Coloring By Adam Sheffer Kuratowski's Theorem Theorem. A graph is planar if and only if it does not have K 5 and K 3,3 as topological minors. We know that if a graph contains

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011

Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly

Solutions to In Class Problems Week 9, Fri.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science November 4 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 4, 2005, 1254 minutes Solutions

Intro to Contemporary Math

Intro to Contemporary Math Planar Graphs Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Announcements Your project (all parts) must be uploaded on Canvas by Tuesday, November 20th.

Discrete mathematics

Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2017/2018 About this file This file is meant to be a guideline for the lecturer. Many

Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences

Section 5.3 1 Recursion 2 Recursion Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences Previously sequences were defined using a specific

v V Question: How many edges are there in a graph with 10 vertices each of degree 6?

ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.

Course Code : MCS-033 Course Title : Advanced Discrete Mathematics Assignment Number : MCA(III)/033/Assignment/2018-19 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th October, 2018

Planar Graph (7A) Young Won Lim 5/21/18

Planar Graph (7A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

Discrete Mathematics Introduction

Discrete Mathematics Introduction Saad Mneimneh 1 Introduction College mathematics will often focus on calculus, and while it is true that calculus is the most important field that started modern mathematics,

List Coloring Graphs

List Coloring Graphs January 29, 2004 CHROMATIC NUMBER Defn 1 A k coloring of a graph G is a function c : V (G) {1, 2,... k}. A proper k coloring of a graph G is a coloring of G with k colors so that no

3D convex hulls. Computational Geometry [csci 3250] Laura Toma Bowdoin College

3D convex hulls Computational Geometry [csci 3250] Laura Toma Bowdoin College Convex Hull in 3D The problem: Given a set P of points in 3D, compute their convex hull convex polyhedron 2D 3D polygon

Connecting face hitting sets in planar graphs

Connecting face hitting sets in planar graphs Pascal Schweitzer and Patrick Schweitzer Max-Planck-Institute for Computer Science Campus E1 4, D-66123 Saarbrücken, Germany pascal@mpi-inf.mpg.de University

Planar Graph (7A) Young Won Lim 6/20/18

Planar Graph (7A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

How many colors are needed to color a map?

How many colors are needed to color a map? Is 4 always enough? Two relevant concepts How many colors do we need to color a map so neighboring countries get different colors? Simplifying assumption (not

Today. Types of graphs. Complete Graphs. Trees. Hypercubes.

Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.

Worksheet for the Final Exam - Part I. Graphs

Worksheet for the Final Exam - Part I. Graphs Date and Time: May 10 2012 Thursday 11:50AM~1:50PM Location: Eng 120 Start with the Self-Test Exercises (pp.816) in Prichard. 1. Give the adjacency matrix

Henneberg construction

Henneberg construction Seminar über Algorithmen FU-Berlin, WS 2007/08 Andrei Haralevich Abstract: In this work will be explained two different types of steps of Henneberg construction. And how Henneberg

Solutions to In-Class Problems Week 4, Fri

Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to In-Class Problems Week 4, Fri Definition: The

Mock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture.

Mock Exam Juanjo Rué Discrete Mathematics II, Winter 2013-2014 Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Problem 1 (2 points): 1. State the definition of perfect graph

Discrete mathematics

Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many

An Investigation of the Planarity Condition of Grötzsch s Theorem

Le Chen An Investigation of the Planarity Condition of Grötzsch s Theorem The University of Chicago: VIGRE REU 2007 July 16, 2007 Abstract The idea for this paper originated from Professor László Babai

Planarity: dual graphs

: dual graphs Math 104, Graph Theory March 28, 2013 : dual graphs Duality Definition Given a plane graph G, the dual graph G is the plane graph whose vtcs are the faces of G. The correspondence between

STUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl

Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on

Week 9: Planar and non-planar graphs. 1st and 3rd of November, 2017

(1/26) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/~niall/ma284/ 1st and 3rd of November, 2017 1 Recall... planar graphs and Euler s formula 2 Non-planar

Reasoning and writing about algorithms: some tips

Reasoning and writing about algorithms: some tips Theory of Algorithms Winter 2016, U. Chicago Notes by A. Drucker The suggestions below address common issues arising in student homework submissions. Absorbing

Mathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3

Mathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3 1. Prove Caley s theorem. There are n n 2 distinct labelled trees on n vertices. (i) Sketch a tree with 11 edges and find the

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can

CS195H Homework 5. Due:March 12th, 2015

CS195H Homework 5 Due:March 12th, 2015 As usual, please work in pairs. Math Stuff For us, a surface is a finite collection of triangles (or other polygons, but let s stick with triangles for now) with

GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS

GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)

Planar graphs. Chapter 8

Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations

Recursive Definitions Structural Induction Recursive Algorithms

Chapter 4 1 4.3-4.4 Recursive Definitions Structural Induction Recursive Algorithms 2 Section 4.1 3 Principle of Mathematical Induction Principle of Mathematical Induction: To prove that P(n) is true for

Which n-venn diagrams can be drawn with convex k-gons?

Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple

Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions

Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions Contents 1 Problems 2 2 Solution key 10 3 Solutions 11 1 1 Problems Question 1: A right triangle has hypothenuse of length 25 in and an

Planar Graphs with Many Perfect Matchings and Forests

Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that

Revolve Vertices. Axis of revolution. Angle of revolution. Edge sense. Vertex to be revolved. Figure 2-47: Revolve Vertices operation

Revolve Vertices The Revolve Vertices operation (edge create revolve command) creates circular arc edges or helixes by revolving existing real and/or non-real vertices about a specified axis. The command

Senior Math Circles November 25, 2009 Graph Theory II

University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles November 5, 009 Graph Theory II Planar Graphs A graph that can be drawn in R without

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces David L. Finn Today, we continue our discussion of subdivision surfaces, by first looking in more detail at the midpoint method and

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition

Math 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2

Math 777 Graph Theory, Spring, 006 Lecture Note 1 Planar graphs Week 1 Weak 1 Planar graphs Lectured by Lincoln Lu Definition 1 A drawing of a graph G is a function f defined on V (G) E(G) that assigns

Euler s formula n e + f = 2 and Platonic solids

Euler s formula n e + f = and Platonic solids Euler s formula n e + f = and Platonic solids spherical projection makes these planar graphs Euler s formula n e + f = and Platonic solids spherical projection

Matching and Planarity

Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of

Artificial Intelligence

Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs

An Interactive Introduction to Graph Theory

An Interactive Introduction to Graph Theory An Interactive Introduction to Graph Theory Chris K. Caldwell 1995 This the first of a series of interactive tutorials introducing the basic concepts of graph

WUCT121. Discrete Mathematics. Graphs

WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,

Recursively Defined Functions

Section 5.3 Recursively Defined Functions Definition: A recursive or inductive definition of a function consists of two steps. BASIS STEP: Specify the value of the function at zero. RECURSIVE STEP: Give

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints

Chapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Section 5.1 Sec.on Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In

Graph Theory Questions from Past Papers

Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory

Majority and Friendship Paradoxes

Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the

Lecture 6: Graph Properties

Lecture 6: Graph Properties Rajat Mittal IIT Kanpur In this section, we will look at some of the combinatorial properties of graphs. Initially we will discuss independent sets. The bulk of the content

MAS341 Graph Theory 2015 exam solutions

MAS4 Graph Theory 0 exam solutions Question (i)(a) Draw a graph with a vertex for each row and column of the framework; connect a row vertex to a column vertex if there is a brace where the row and column

Unit 2A: Angle Pairs and Transversal Notes

Unit 2A: Angle Pairs and Transversal Notes Day 1: Special angle pairs Day 2: Angle pairs formed by transversal through two nonparallel lines Day 3: Angle pairs formed by transversal through parallel lines

K 4,4 e Has No Finite Planar Cover

K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005

Pick s Theorem! Finding the area of polygons on a square lattice grid.

Section 3 4A Pick s Theorem! Finding the area of polygons on a square lattice grid. A polygon is a 2 dimensional closed figure whose sides are straight line segments. Each of the sides is connected to

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints

Crossing Numbers on the Disk with Multiple Holes

Crossing Numbers on the Disk with Multiple Holes Albert Soh Under the Direction of Mr. Gaku Liu Project Suggested by Professor Jacob Fox Massachusetts Institute of Technology Research Science Institute

CS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:

CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need

TWO CONTRIBUTIONS OF EULER

TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention

The following is a summary, hand-waving certain things which actually should be proven.

1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines

Every planar graph is 4-colourable and 5-choosable a joint proof

Peter Dörre Fachhochschule Südwestfalen (University of Applied Sciences) Frauenstuhlweg, D-58644 Iserlohn, Germany doerre@fh-swf.de Mathematics Subject Classification: 05C5 Abstract A new straightforward

Chapter 6 GRAPH COLORING

Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called

Using Euler s Theorem

Using Euler s Theorem Suppose that a connected, planar graph has 249 vertices and 57 faces. How many edges does it have? A: 106 B: 194 C: 304 D: 306 E: We don t have enough information Using Euler s Theorem

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

Basics of Graph Theory

Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their

Remarks on Kuratowski s Planarity Theorem. A planar graph is a graph that can be drawn in a plane without edges crossing one another.

Remarks on Kuratowski s Planarity Theorem A planar graph is a graph that can be drawn in a plane without edges crossing one another. This theorem says that a graph is planar if and only if it does not

LAMC Advanced Circle October 9, Oleg Gleizer. Warm-up

LAMC Advanced Circle October 9, 2016 Oleg Gleizer prof1140g@math.ucla.edu Warm-up Problem 1 Prove that a straight line tangent to a circle is perpendicular to the radius connecting the tangency point to

Simple Graph. General Graph

Graph Theory A graph is a collection of points (also called vertices) and lines (also called edges), with each edge ending at a vertex In general, it is allowed for more than one edge to have the same

Integrated Math I. IM1.1.3 Understand and use the distributive, associative, and commutative properties.

Standard 1: Number Sense and Computation Students simplify and compare expressions. They use rational exponents and simplify square roots. IM1.1.1 Compare real number expressions. IM1.1.2 Simplify square

Planar graphs. Math Prof. Kindred - Lecture 16 Page 1

Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of

PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1

PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1 Find a Hamiltonian cycle in the following graph: Proof. Can be done by trial an error. Here we find the path using some helpful observations.

Planar Graphs and Surfaces. Graphs 2 1/58

Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having

Section 4: Introduction to Polygons Part 1

The following Mathematics Florida Standards will be covered in this section: MAFS.912.G-CO.1.1 Know precise definitions of angle, circle, perpendicular line, parallel line, and line segment, based on the

Math 311. Trees Name: A Candel CSUN Math

1. A simple path in a graph is a path with no repeated edges. A simple circuit is a circuit without repeated edges. 2. Trees are special kinds of graphs. A tree is a connected graph with no simple circuits.

Inference rule for Induction

Inference rule for Induction Let P( ) be a predicate with domain the positive integers BASE CASE INDUCTIVE STEP INDUCTIVE Step: Usually a direct proof Assume P(x) for arbitrary x (Inductive Hypothesis),

arxiv: v1 [math.co] 17 Jan 2014

Regular matchstick graphs Sascha Kurz Fakultät für Mathematik, Physik und Informatik, Universität Bayreuth, Germany Rom Pinchasi Mathematics Dept., Technion Israel Institute of Technology, Haifa 2000,

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.

Graph theory Po-Shen Loh June 013 1 Basic results We begin by collecting some basic facts which can be proved via bare-hands techniques. 1. The sum of all of the degrees is equal to twice the number of