This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Here is a list of terms you will be assumed to be familiar with, not that this list may not be complete. • subset • graph • isomorphic • connected • degree (sequence) • planar • • Find the chromatic number of the following graph. u u u u u u @ @ @ @ @ H H H H H H H H H H P P P P P P P P P P P P P P P • Draw a loop-free undirected simple graph on 10 vertices with 20 edges, such that the graph is planar and has an Eulerian circuit. State why the graph drawn satisfies all these properties. • Alice and Bob are examining a graph with 12 vertices and 31 edges. Alice insists that the graph is planar, but Bob disagrees. Can we tell who is correct, and if so who? Explain your answer in full detail. • There are four graphs, each of which has exactly one of the following properties; one contains a cycle containing every vertex, one contains an Eulerian circuit, one is planar, and one is has multiple edges. These graphs have the following degree sequences; – 7 , 7 , 7 , 7 ,...
View Full Document
This note was uploaded on 11/08/2009 for the course MATH 2602 taught by Professor Costello during the Spring '09 term at Georgia Institute of Technology.
- Spring '09