Section 4.7 Chapter Summary
¶Hopefully this chapter has given you some sense for the wide variety of graph theory topics as well as why these studies are interesting. There are many more interesting areas to consider and the list is increasing all the time; graph theory is an active area of mathematical research.
One reason graph theory is such a rich area of study is that it deals with such a fundamental concept: any pair of objects can either be related or not related. What the objects are and what “related” means varies on context, and this leads to many applications of graph theory to science and other areas of math. The objects can be countries, and two countries can be related if they share a border. The objects could be land masses which are related if there is a bridge between them. The objects could be websites which are related if there is a link from one to the other. Or we can be completely abstract: the objects are vertices which are related if their is an edge between them.
What question we ask about the graph depends on the application, but often leads to deeper, general and abstract questions worth studying in their own right. Here is a short summary of the types of questions we have considered:
Can the graph be drawn in the plane without edges crossing? If so, how many regions does this drawing divide the plane into?
Is it possible to color the vertices of the graph so that related vertices have different colors using a small number of colors? How many colors are needed?
Is it possible to trace over every edge of a graph exactly once without lifting up your pencil? What other sorts of “paths” might a graph posses?
Can you find subgraphs with certain properties? For example, when does a (bipartite) graph contain a subgraph in which all vertices are only related to one other vertex?
Not surprisingly, these questions are often related to each other. For example, the chromatic number of a graph cannot be greater than 4 when the graph is planar. Whether the graph has an Euler path depends on how many vertices each vertex is adjacent to (and whether those numbers are always even or not). Even the existence of matchings in bipartite graphs can be proved using paths.
Exercises Chapter Review
¶1.
Which (if any) of the graphs below are the same? Which are different? Explain.
The first and the third graphs are the same (try dragging vertices around to make the pictures match up), but the middle graph is different (which you can see, for example, by noting that the middle graph has only one vertex of degree 2, while the others have two such vertices).
2.
Which of the graphs in the previous question contain Euler paths or circuits? Which of the graphs are planar?
The first (and third) graphs contain an Euler path. All the graphs are planar.
3.
Draw a graph which has an Euler circuit but is not planar.
For example, \(K_5\text{.}\)
4.
Draw a graph which does not have an Euler path and is also not planar.
For example, \(K_{3,3}\text{.}\)
5.
Consider the graph \(G = (V, E)\) with \(V = \{a,b,c,d,e,f,g\}\) and \(E = \{ab, ac, af, bg, cd, ce\}\) (here we are using the shorthand for edges: \(ab\) really means \(\{a,b\}\text{,}\) for example).
Is the graph \(G\) isomorphic to \(G' = (V', E')\) with \(V' = \{t, u, v, w, x, y, z\}\) and \(E' = \{tz, uv, uy, uz, vw, vx\}\text{?}\) If so, give the isomoprhism. If not, explain how you know.
Find a graph \(G''\) with 7 vertices and 6 edges which is NOT isomorphic to \(G\text{,}\) or explain why this is not possible.
Write down the degree sequence for \(G\text{.}\) That is, write down the degrees of all the vertices, in decreasing order.
Find a connected graph \(G'''\) with the same degree sequence of \(G\) which is NOT isomorphic to \(G\text{,}\) or explain why this is not possible.
What kind of graph is \(G\text{?}\) Is \(G\) complete? Bipartite? A tree? A cycle? A path? A wheel?
Is \(G\) planar?
What is the chromatic number of \(G\text{?}\) Explain.
Does \(G\) have an Euler path or circuit? Explain.

Yes, the graphs are isomorphic, which you can see by drawing them. One isomorphism is:
\begin{equation*} f = \begin{pmatrix} a \amp b \amp c \amp d \amp e \amp f \amp g \\ u \amp z \amp v \amp x \amp w \amp y \amp t \end{pmatrix}\text{.} \end{equation*} 
This is easy to do if you draw the picture. Here is such a graph:
Any labeling of this graph will be not isomorphic to \(G\text{.}\) For example, we could take \(V'' = \{a,b,c,d,e,f,g\}\) and \(E'' = \{ab, ac, ad, be, cf, dg\} \text{.}\)
The degree sequence for \(G\) is \((3, 3, 2, 1, 1, 1 1)\text{.}\)

In general this should be possible: the degree sequence does not determine the graph's isomorphism class. However, in this case, I was almost certain this was not possible. That is, until I stumbled up this:
\(G\) is a tree (there are no cycles) and as such also bipartite.
Yes, all trees are planar. You can draw them in the plane without edges crossing.
The chromatic number of \(G\) is 2. It shouldn't be hard to give a 2coloring (for example, color \(a, d, e, g\) red and \(b, c, f\) blue), but we know that all bipartite graphs have chromatic number 2.
It is clear from the drawing that there is no Euler path, let alone an Euler circuit. Also, since there are more than 2 vertices of odd degree, we know for sure there is no Euler path.
6.
If a graph has 10 vertices and 10 edges and contains an Euler circuit, must it be planar? How many faces would it have?
Yes. According to Euler's formula it would have 2 faces. It does. The only such graph is \(C_{10}\text{.}\)
7.
Suppose \(G\) is a graph with \(n\) vertices, each having degree 5.
For which values of \(n\) does this make sense?
For which values of \(n\) does the graph have an Euler path?
What is the smallest value of \(n\) for which the graph might be planar? (tricky)
Only if \(n \ge 6\) and is even.
None.
12. Such a graph would have \(\frac{5n}{2}\) edges. If the graph is planar, then \(n  \frac{5n}{2} + f = 2\) so there would be \(\frac{4+3n}{2}\) faces. Also, we must have \(3f \le 2e\text{,}\) since the graph is simple. So we must have \(3\left(\frac{4 + 3n}{2}\right) \le 5n\text{.}\) Solving for \(n\) gives \(n \ge 12\text{.}\)
8.
At a school dance, 6 girls and 4 boys take turns dancing (as couples) with each other.
How many couples danced if every girl dances with every boy?
How many couples danced if everyone danced with everyone else (regardless of gender)?
Explain what graphs can be used to represent these situations.
There were 24 couples: 6 choices for the girl and 4 choices for the boy.
There were 45 couples: \({10 \choose 2}\) since we must choose two of the 10 people to dance together.
For part (a), we are counting the number of edges in \(K_{4,6}\text{.}\) In part (b) we count the edges of \(K_{10}\text{.}\)
9.
Among a group of \(n\) people, is it possible for everyone to be friends with an odd number of people in the group? If so, what can you say about \(n\text{?}\)
Yes, as long as \(n\) is even. If \(n\) were odd, then corresponding graph would have an odd number of odd degree vertices, which is impossible.
10.
Your friend has challenged you to create a convex polyhedron containing 9 triangles and 6 pentagons.
Is it possible to build such a polyhedron using only these shapes? Explain.
You decide to also include one heptagon (sevensided polygon). How many vertices does your new convex polyhedron contain?
Assuming you are successful in building your new 16faced polyhedron, could every vertex be the joining of the same number of faces? Could each vertex join either 3 or 4 faces? If so, how many of each type of vertex would there be?
No. The 9 triangles each contribute 3 edges, and the 6 pentagons contribute 5 edges. This gives a total of 57, which is exactly twice the number of edges, since each edge borders exactly 2 faces. But 57 is odd, so this is impossible.
Now adding up all the edges of all the 16 polygons gives a total of 64, meaning there would be 32 edges in the polyhedron. We can then use Euler's formula \(v  e + f = 2\) to deduce that there must be 18 vertices.
If you add up all the vertices from each polygon separately, we get a total of 64. This is not divisible by 3, so it cannot be that each vertex belongs to exactly 3 faces. Could they all belong to 4 faces? That would mean there were \(64/4 = 16\) vertices, but we know from Euler's formula that there must be 18 vertices. We can write \(64 = 3x + 4y\) and solve for \(x\) and \(y\) (as integers). We get that there must be 10 vertices with degree 4 and 8 with degree 3. (Note the number of faces joined at a vertex is equal to its degree in graph theoretic terms.)
11.
Is there a convex polyhedron which requires 5 colors to properly color the vertices of the polyhedron? Explain.
No. Every polyhedron can be represented as a planar graph, and the Four Color Theorem says that every planar graph has chromatic number at most 4.
12.
How many edges does the graph \(K_{n,n}\) have? For which values of \(n\) does the graph contain an Euler circuit? For which values of \(n\) is the graph planar?
\(K_{n,n}\) has \(n^2\) edges. The graph will have an Euler circuit when \(n\) is even. The graph will be planar only when \(n \lt 3\text{.}\)
13.
The graph \(G\) has 6 vertices with degrees \(1, 2, 2, 3, 3, 5\text{.}\) How many edges does \(G\) have? If \(G\) was planar how many faces would it have? Does \(G\) have an Euler path?
\(G\) has 8 edges (since the sum of the degrees is 16). If \(G\) is planar, then it will have 4 faces (since \(6  8 + 4 = 2\)). \(G\) does not have an Euler path since there are more than 2 vertices of odd degree.
14.
What is the smallest number of colors you need to properly color the vertices of \(K_{7}\text{.}\) Can you say whether \(K_7\) is planar based on your answer?
\(7\) colors. Thus \(K_7\) is not planar (by the contrapositive of the Four Color Theorem).
15.
What is the smallest number of colors you need to properly color the vertices of \(K_{3,4}\text{?}\) Can you say whether \(K_{3,4}\) is planar based on your answer?
The chromatic number of \(K_{3,4}\) is 2, since the graph is bipartite. You cannot say whether the graph is planar based on this coloring (the converse of the Four Color Theorem is not true). In fact, the graph is not planar, since it contains \(K_{3,3}\) as a subgraph.
16.
Prove that \(K_{3,4}\) is not planar. Do this using Euler's formula, not just by appealing to the fact that \(K_{3,3}\) is not planar.
We have that \(K_{3,4}\) has 7 vertices and 12 edges (each vertex in the group of 3 has degree 4). Then by Euler's formula we have that \(7  12 + f = 2\) so if the graph were planar, it would have \(f = 7\) faces. However, since the girth of the graph is 4 (there are no cycles of length 3) we get that \(4f \le 2e\text{.}\) But this would mean that \(28 \le 24\text{,}\) a contradiction.
17.
A dodecahedron is a regular convex polyhedron made up of 12 regular pentagons.
Suppose you color each pentagon with one of three colors. Prove that there must be two adjacent pentagons colored identically.
What if you use four colors?
What if instead of a dodecahedron you colored the faces of a cube?
For all these questions, we are really coloring the vertices of a graph. You get the graph by first drawing a planar representation of the polyhedron and then taking its planar dual: put a vertex in the center of each face (including the outside) and connect two vertices if their faces share an edge.
Since the planar dual of a dodecahedron contains a 5wheel, it's chromatic number is at least 4. Alternatively, suppose you could color the faces using 3 colors without any two adjacent faces colored the same. Take any face and color it blue. The 5 pentagons bordering this blue pentagon cannot be colored blue. Color the first one red. Its two neighbors (adjacent to the blue pentagon) get colored green. The remaining 2 cannot be blue or green, but also cannot both be red since they are adjacent to each other. Thus a 4th color is needed.
The planar dual of the dodecahedron is itself a planar graph. Thus by the 4color theorem, it can be colored using only 4 colors without two adjacent vertices (corresponding to the faces of the polyhedron) being colored identically.
The cube can be properly 3colored. Color the “top” and “bottom” red, the “front” and “back” blue, and the “left” and “right” green.
18.
Decide whether the following statements are true or false. Prove your answers.
If two graph \(G_1\) and \(G_2\) have the same chromatic number, then they are isomorphic.
If two graphs \(G_1\) and \(G_2\) have the same number of vertices and edges and have the same chromatic number, then they are isomorphic.
If two graphs are isomorphic, then they have the same chromatic number.
False. To prove this, we can give an example of a pair of graphs with the same chromatic number that are not isomorphic. For example, \(K_{3,3}\) and \(K_{3,4}\) both have chromatic number 2, but are not isomorphic.
False. The previous example does not work, but you can easily draw two trees that have the same number of vertices and edges but are not isomorphic. Since all trees have chromatic number 2, this is a counterexample.
True. If there is an isomorphism from \(G_1\) to \(G_2\text{,}\) then we have a bijection that tells us how to match up vertices between the graph. Any proper vertex coloring of \(G_1\) will tell us how to properly color \(G_2\text{,}\) simply by coloring \(f(v_i)\) the same color as \(v_i\text{,}\) for each vertex \(v_i \in V\text{.}\) That is, color the vertices in \(G_2\) exactly how you color the corresponding vertices in \(G_1\text{.}\) Similarly, any proper vertex coloring of \(G_2\) corresponds to a proper vertex coloring of \(G_1\text{.}\) Thus the smallest number of colors needed to properly color \(G_1\) cannot be smaller than the smallest number of colors needed to properly color \(G_2\text{,}\) and viceversa, so the chromatic numbers must be equal.
19.
If a planar graph \(G\) with \(7\) vertices divides the plane into 8 regions, how many edges must \(G\) have?
\(G\) has \(13\) edges, since we need \(7  e + 8 = 2\text{.}\)
20.
Consider the graph below:
Does the graph have an Euler path or circuit? Explain.
Is the graph planar? Explain.
Is the graph bipartite? Complete? Complete bipartite?
What is the chromatic number of the graph.
The graph does have an Euler path, but not an Euler circuit. There are exactly two vertices with odd degree. The path starts at one and ends at the other.
The graph is planar. Even though as it is drawn edges cross, it is easy to redraw it without edges crossing.
The graph is not bipartite (there is an odd cycle), nor complete.
The chromatic number of the graph is 3.
21.
For each part below, say whether the statement is true or false. Explain why the true statements are true, and give counterexamples for the false statements.
Every bipartite graph is planar.
Every bipartite graph has chromatic number 2.
Every bipartite graph has an Euler path.
Every vertex of a bipartite graph has even degree.
A graph is bipartite if and only if the sum of the degrees of all the vertices is even.
False. For example, \(K_{3,3}\) is not planar.
True. The graph is bipartite so it is possible to divide the vertices into two groups with no edges between vertices in the same group. Thus we can color all the vertices of one group red and the other group blue.
False. \(K_{3,3}\) has 6 vertices with degree 3, so contains no Euler path.
False. \(K_{3,3}\) again.
False. The sum of the degrees of all vertices is even for all graphs so this property does not imply that the graph is bipartite.
22.
Consider the statement “If a graph is planar, then it has an Euler path.”
Write the converse of the statement.
Write the contrapositive of the statement.
Write the negation of the statement.
Is it possible for the contrapositive to be false? If it was, what would that tell you?
Is the original statement true or false? Prove your answer.
Is the converse of the statement true or false? Prove your answer.
If a graph has an Euler path, then it is planar.
If a graph does not have an Euler path, then it is not planar.
There is a graph which is planar and does not have an Euler path.
Yes. In fact, in this case it is because the original statement is false.
False. \(K_4\) is planar but does not have an Euler path.
False. \(K_5\) has an Euler path but is not planar.
23.
Let \(G\) be a connected graph with \(v\) vertices and \(e\) edges. Use mathematical induction to prove that if \(G\) contains exactly one cycle (among other edges and vertices), then \(v = e\text{.}\)
Note: this is asking you to prove a special case of Euler's formula for planar graphs, so do not use that formula in your proof.
You might want to give the proof in two parts. First prove by induction that the cycle \(C_n\) has \(v=e\text{.}\) Then consider what happens if the graph is more than just the cycle.