Professional Documents
Culture Documents
HW13
HW13
SOLUTIONS
In-class Exercise 46. (a) Show that K2,3 , K5,2 , K5 e for any edge e, and W6 are all planar by
giving planar representations of them.
(c) Argue that K5 is not planar by doing a regional analysis like we did for K3,3 .
(a) Determine which of the following are planar. For those that are not, explain why. For those
that are, draw a planar representation and verify Eulers formula. You will want to label the
vertices to aid in your explanations and/or drawings.
(b) Suppose that a connected bipartite planar simple graph has m edges and n 3 vertices. Show
that m 2n 4.
Proof. In a bipartite graph, there are no odd cycles. So every face of a bipartite planar graph
has at least 4 edges along its boundary. So the handshake theorem for faces, followed by Eulers
formula, says
2m =
f F
So 2m 4n 8, which is
m 2n 4.
(c) Suppose that a planar graph has k connected components, m edges, and n vertices. Also
suppose that the plane is divided into f faces by a planar representation of the graph. Find a
formula for f in terms of m, n, and k.
Consider the graph with k isolated vertices (i.e. no edges). This graph has 1 face and k
vertices. So
|F | |E| + |V | = k + 1.
()
Now, just as we did for Eulers formula, we can prove that this formula holds (for a fixed k)
in general by induction on the number of vertices (where we just did the base case. So assume
that any planar graph with exactly k connected components and n k vertices has (). Now
let G be a graph with k connected components and n + 1 vertices. Since there are more vertices
than connected components, there is at least one connected component with more than one
vertex. Let v be a vertex in that component, and consider G v. By our inductive hypothesis,
we have that G v satisfies (). Then adding v to G, just as in the proof of Eulers formula,
preserves |F | |E| + |V |. So () holds.
25.
graph. Find a formula for r in terms of e, v, and k.
c
20.
20.
19. Which of these nonplanar graphs have the property
that
a
b
a
the removal of any vertex and all edges incident with that
vertex produces a planar graph?
a
e
b) K6
c) K3,3
d) eK3,4
a) K5
ected components,
e that the plane is
presentation of the
f e, v, and k.
24.
f
c
This is not planar, because G {ad, bi, df, eg, f h} (all the
curvy edges) is a subdivision of K5 .
(ii)
h
d
e
g
f
25.
) K3,4
the
crossing
num
27.
5
In Exercises 2022 determine whether the given graph is
graphs.
homeomorphic to K3,3 .
f
f
b)
a) K5
f
e ?
In-class Exercise 48. (a) Which of the following graphsgare homemorphic
g to K3,3
h
h
d)
K
e)
3,4
c
20.
The crossing number of a simple graph is the minimum numa
b
b 21. a ber ofccrossings
graph
drawn
in thenum
Findis the
crossing
b that can occur
c when this28.
21.d a
28.
edges
plane where no three arcs representing
are permitted
to 29.
29. Show
that if m and
n ar
cross at
the same point.
is
ing
number
of
K
m,n
g
h
g
h
e
26. Show that K3,3 has 1 as its crossing number.
(n 2)/16. [Hint: Pla
27. Find the crossing numbers of each ofthat
theynonplanar
are equally sp
these
gin and place n vertice
graphs.
f
equally
f K5 e
e
d
b) fK6
c) K7 spaced and sym
a)
d
g
h
nect
d)
K
e)
K
f ) Keach
3,4
4,4
5,5 of the m ver
(i)
(ii)
vertices
on the y-axis a
a
b
c 22.
22. 28. Find athe crossing number of the Petersen graph.
21. a
Theintegers,
thickness
a simple
The g
l
theofcrossb 29. l Show that if bm and n are even positive
planar
subgraphs
of
G
that
is less than or equal to mn(m 2)plana
ing number of Km,n
g
h
k
c
k c
has30.
2a
30.along
Showthe
that
K3,3 so
(n 2)/16. [Hint: Place m vertices
x-axis
31. Findabout
the thickness
of th
that they are equally spaced and symmetric
the ori- 31.
j
d
j d
32. Show
thatthey
if G is
conn
gin and place n vertices along the y-axis
so that
area 32.
e edges,
where v
equally spaced and symmetric about theand
origin.
Now conf
e
d
e vertices on the x-axis
i
i e
leasttoe/(3v
the
6).
nect each of the m
each of
to
vertices
on
the
y-axis
and
count
the
crossings.]
f
33.
Use
Exercise
32
f
33.sh
h
h
a
22.
least
(n
+
7)/6
when
g
g
The thickness
of a simple graph G is the smallest number of
(iii)
l
b
34. Show
conn
planar2325
subgraphs
of
that havetheorem
G as their
union.that if G is a 34.
In Exercises 2325 use
Kuratowskis
theorem
to G
determine
In
Exercises
use
Kuratowskis
to determine
c
k
and
e
edges,
where
v
has 2 as its thickness.
30.
that Kis
whether the given graph
is planar.
3,3planar.
whether
the Show
given graph
then the thickness of G
31. h
Find
the thickness
of thebecause
graphs in it
Exercise
27.
(i) is not
because it is planar
(pull the
edge between
a and
out).
(ii) is not
has
d
j
Use Exercise 34 to show
b
c
b d if G is a cconnected simple
d 35.
23. a
23. a 32.
graph with v vertices 35.
3-cycles. (iii) is, where the edges ki, ka, ab, ce, eg, and
gi haveShow
beenthatsubdivided.
m and n are not both 1
and e edges, where v 3, then the thickness of G is at
whenever
m and n are
e
i
least e/(3v 6).
36. Draw K5 on thesurfa
33. Use Exercise 32 to show that the thickness of Kn is at 36.
f
(b) Which of theh following graphs are planar? Use Kuratowskis
or Wagners theorems.
solid) so that no edges
least (n + 7)/6 whenever n is a positive integer.
g
37. Draw K3,3 on thesurfa
(i)
e
f
g
h
e 34. Show fthat if G is a gconnected simple
h
graph with v vertices 37.
In Exercises 2325 use Kuratowskis theorem to determine
and e edges, where v 3, and no circuits of length three,
whether the given graph is planar.
then the thickness of G is at least e/(2v 4).
35.
Use
Exercise 34 to show that the thickness of Km,n , where
a
b
c
d
23.
f
a
b
c
d
a
c
h
m and n are not both 1, is at least mn/(2m + 2n 4)
whenever m and n are positive integers.
=
36. Draw Planar!
K5 on the surface of a torus (a doughnut-shaped
solid)
so
that no edges cross.
e
g
e
g
f
h
b
d
37. Draw K3,3 on the surface of a torus so that no edges cross.
e
f
g
h
g
a
he given graph is
f
2v 4 if v 3.
nected components,
e that the plane is 6
presentation of the
of e, v, and k.
d
e
g
f
25.
) K3,4
(iii)
b) K6
e) K4,4
c) K7
f ) K5,5
and
(iii) K7
There is the following drawing of K 7 with 9 crossings, which shows that the crossing
number is no more than 9:
and
2
3
6
(iv) K3,4 : The crossing number cannot be 1, since any crossing involves an edge incident to one of
the vertices on the 4 side, and if there were only 1 crossing, then deleting one such vertex on
the 4 side would yield a planar drawing of K3,3 . Thus the crossing number of K3,4 is 2 since
the following is a drawing of K3,4 with 2 crossings:
and
(v) K4,4 : Similarly as above, the crossing number of K4,4 bust be larger than 2 because we could
eliminate a crossing with the removal of some vertex, and K4,4 v = K3,4 . Also, it cant be 3
because some two crossings would have to share a special vertex in common (3 4 > 8) whose
removal would eliminate two crossings at a time. So it must be at least 4, and the following
drawing of K4,4 has 4 crossings:
The thickness of K4,4 is then 2 because its not planar, but is the union of
and
a
A=
a
a
b
e
C= b
B=
c
D=
G= e
H=
f
c
(a) Choose a planar drawing of each of A, B, C, D, G, and H, and draw the corresponding dual
graph.
Planar drawing:
a
b
Dual graph:
A:
S
c
Planar drawing:
b
c
B:
R
g
Dual graph:
R
S
V
U
e
Planar drawing:
T
Dual graph:
T
a
C:
R
Planar drawing:
Dual graph:
U
a
b
U
R
D:
Q
M
c
S
T
T
N
R
Q
732
10 / Graphs
10
1 Red
1
2 Blue
Brown 7
7
2
Planar
drawing:
d
R b
3
a
c T
S
e
G:
Dual graph:
R
Red 6
Time Period
I
II
III
IV
3 Green
S
5 Green
4 Brown
EXAMPLE 7
H:
R b
a Registers
Index
In efficient compilers the execution of loops is speeded up when fr
Dual
graph: in index registers in the central processing uni
T used variables are stored
temporarily
S e memory. For a given
R loop, how many index registers are needed? This
of in regular
can be addressed using a graph coloring model. To set up the model, let each vertex o
S
T
represent
f a variable in the loop. There is an edge between two vertices if the varia
represent must be stored in index registers at the same time during the execution of
Thus, the chromatic number of the graph gives the number of index registers needed
different registers must be assigned to variables when the vertices representing these
are adjacent in the graph.
c
Exercises
2.
1.
B
A
A
A
D
E
different registers must be assigned to variables when the vertices representing these variables
are adjacent in the graph.
11
2.
B
A
D
3.
11.
B
F
10.8 Graph C
C
j
Foran
theexample
graphs in of
Exercises
511, decide
4.
(e) Calculate the chromatic
numbers for A, B, C, D, G, and H. For each,12.
give
a
possible to decrease the chromatic number
vertex coloring of the corresponding graph
using exactly colors.
a single vertex and all edges incident with
D
B
F
A
All of these graphs except
for G has
a K3 in it, so must have chromatic
overhave
2. a chromatic number of
13. number
Which graphs
E
C
A:
B=
5. a
=3
c
g
c
b
C = 15. What is the chromatic number of Wn ?
=3
=3
c
8.
e
f
7.
a
D=
6.
G=
1 to isolated
2
3
4
None of them have a vertex that would totally disconnect the graph (reduce it
vertices). So none of them can have their chromatic number reduced to 1. 1So,
in particular,
85
175 200
e
c
Gs chromatic number cannot be reduced by removing a single vertex. However, removing b
2
85
125 175
from A, g from B, a from C, and b from H will remove all triangles and drop the chromatic
d
a
10.
i
50
100
100
160
175
125
100
200
250
200
175
100
210
220
50
100
200
210
100
100
160
250
220
100
12
number to 2. Finally, D has two disjoint 3-cycles, so removing any one vertex will not drop the
chromatic number.
(g) Classify all graphs with chromatic number (i) 1, and (ii) 2.
If the chromatic number of a graph is 1, then that graph cannot have any edges. So the
graphs with chromatic number 1 are those that are a collection of isolated vertices.
If the chromatic number is 2, then the graph is bipartite. So a graph has chromatic number
2 if and only if it has at least one edge, and has no odd cycles.
(h) What are the chromatic numbers of
(i) Kn : (Kn ) = n since every vertex in incident to every other vertex.
(ii) Km,n : (Km,n ) = 2 since it is bipartite. (Unless m or n is 0, in which case the chromatic
number is 1.)
(iii) Cn : (Cn ) = 2 if n is even, and 3 if n is odd.
(iv) Wn : (Wn ) = 3 if n is even (since the cycle is 2-colorable, but the middle vertex is
adjacent to everything), and 4 if n is odd (similarly since the cycle is 3-colorable).
(v) Qn : (Qn ) = 2 since it is bipartite.
(vi) The Petersen graph: = 3, it cannot be 2 as it contains odd cycles, but can be 3-colored
as follows: