HW5 - EECS 203: DISCRETE MATHEMATICS Homework 5 Due...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 203: DISCRETE MATHEMATICS Homework 5 Due Thursday, October 18 at 4pm Put your name and discussion section number (not the meeting time) on the first page of your homework. Submit your homework to (a) CTools, as a PDF file, or (b) the drop box marked “EECS 203” in room EECS 2420. If neither (a) nor (b) is possible please turn in your homework at one of the discussion sections. 1. (4 points each) Chapter 9.4, Problems 55 and 56 2. A square graph is a planar graph where each face is bounded by exactly 4 edges. (a) (5 points) If a square graph has n vertices, how many edges do you need to add in order to triangulate it? (b) (extra credit, 2 points) Prove that all square graphs are bipartite. 3. (5 points) A honeycomb graph is a planar graph where each face is bounded by exactly 6 edges. If a honeycomb graph has n vertices, what is the maximum number of edges it can have? 4. (4 points) Starting from your hotel you decide to take a walking tour of an unknown city. You have a fantastic memory but no sense of direction so you decide to use the following rules to guide your
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/20/2010 for the course EECS 203 taught by Professor Yaoyunshi during the Fall '07 term at University of Michigan.

Ask a homework question - tutors are online