{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

final-review - of degree 4 How many edges does it have Use...

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

View Full Document Right Arrow Icon
CS 173: Discrete Structures, Spring 2010 HW 12 These problems should not be turned in. They are to help you review for the final. 1. Planar graphs (a) Show that this graph is planar by redrawing it without crossings: A B C D E (b) Suppose that G is an undirected connected simple planar graph with 10 vertices, all
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: of degree 4. How many edges does it have? Use Euler’s formula and the Handshaking Theorem to calculate how many regions it has. 2. Graph coloring ±ind the chromatic numbers for the following graphs. G1: A B C D E G2: 1 5 3 4 2 1...
View Full Document

{[ snackBarMessage ]}