Ch. 1: Denitions and Examples
Due: Beginning of class on Monday, April 7
4-4-14
1. Here is a graph that doesnt appear to be bipartite. First, verify that each of its cycles
only has even length. Next, nd a way to draw it in a bipartite manner.
2. Can a ki
Ch. 1: Denitions and Examples
Due: Beginning of class on Friday, April 4
4-2-14
1. Compute the degree sequences of each of the graphs from Mondays homework.
2. Is it possible to nd a graph with 5 vertices such that each vertex has degree 3?
3. Is it possi
Ch. 2: Eulerian and Hamiltonian Graphs
Due: Beginning of class on Monday, April 14
4-11-14
Decide whether or not each of these graphs is Eulerian and/or Hamiltonian. If the graph
is Eulerian and/or Hamiltonian, exhibit an Eulerian and/or Hamiltonian circu
Ch. 5: Graph Colorings
5-7-14
This assignment is due on Monday, May 12.
At some point between now and Mondays class, nd a quiet place to sit down and focus
on math for (at least) two hours. During that time, your objective is to try to prove the
Four Colo
Ch. 4: Planar Graphs
4-28-14
1. Draw three planar graphs. How many vertices, edges, and regions does each one have?
2. Prove that every tree is planar. How many vertices, edges, and regions does a planar
drawing of a tree have?
3. In class, we looked at t
Ch. 3: Trees
Due: Beginning of class on Wednesday, April 16
4-14-14
Denition: A tree is a connected graph with no cycles.
1. Draw 5 examples of trees.
2. Prove that deleting any edge from a tree results in a disconnected graph.
3. Let G be a graph with th