The fifth homework of "Graphics"

Name: Tang Xinyu

student ID: 11917017

9.1.2
Proof: Due to the symmetry of K5, K3, and 3, it is only necessary to verify that K5 − e, K3, and 3−e are
planar maps for one of their edges e.Figure Ca) Cb) are their corresponding plan views, so the conclusion is
true.

9.2.5
Proof: For φ(G) = 1, G = T, E∗ = φ, then T ∗ is a trivial graph, and the conclusion is true.When φ(G) ≥
2, since each face of G contains e ∈ / E(T ), that is, each point in G∗ is associated with the edge of E∗,
that is, T ∗ is G One of the∗ generation subgraphs.If T ∗ contains a country with G∗, it is known from
Exercise 9.2.3 that T contains a bond in G. This contradicts theorem 2.6, so T ∗ does not contain G∗. .For
G, every time one side of E(T) is removed, G reduces one side.When all the edges in E(T) are removed,
G becomes a tree T, so that ε(T ∗) = ε(T) = φ(G) − 1 = ν(G∗) − 1.Thus by Exercise 2.1.5, T ∗ is the
spanning tree in G∗.
9.2.6
Proof: Let G be a plane single picture Cν ≥ 3), add a new bar as much as possible on G, and expand
the plane single image with the largest side, which is Gmax. If there is face f, dGmax in Gmax ( f ) ≥ 4, if the
boundary of f contains the hanging edge v0v1, dG max(v0) = 1, the boundary point of v0 and f different
1
from v1 is connected with the edge e in f, obviously Gmax + e is still V (G) is a plane single graph of the
vertex set, and it is more than the edge of Gmax, which contradicts the definition of Gmax.Therefore, the
boundary of f is country C, let C be v1v2 . . . vk (k ≥ 4), if there is no v1v3 edge in Gmax, connect v1v3 side
in f, and make it el; Gmax contains the v1v3 edge, it must not be in f, we then connect v1, v3 to the edge in
f, so the two v1v3 sides inside and outside f form a Jordan curve C, v2 ∈ intC, v4 ∈ extC, so it is known by
the Jordan curve theorem that it is not in the G outside f

2
Can contain v2v4 side, at this time we connect v2v4 side in f, and make it el.Therefore, in either case,
there is a constant Gmax + el, which is still a plane single graph with V (G) as the vertex set, and it is more
than the edge of Gmax, which is in contradiction with the definition of Gmax.Therefore, the facet in Gmax
is always 3.So Gmax is a plane triangulation single image.Obviously, according to the definition of Gmax,
G is its generated subgraph.
9.3.1
),f∈T
Proof: Ca) Since the country length of G is k, dG(f ) ≥ k, 2ε = dG(f ) ≥ kφ, substituting it
into Euler's formula, simplifying
Obtain ε ≤ k(ν − 2)/(k − 2).
Cb) Petersen's figure is 5, ν = 10, ε = 15, which does not satisfy Ca), so the Petersen diagram is a non-
planar.
9.5.2
Proof: From the Petersen diagram, remove the edges with dots on the way, as shown, 1, 2, 3, 4, 5, 6
are the two parts of the vertices of K3, 3, and the rest of the vertices are the weight of K3, 3. Points.So the
Petersen graph contains K3, 3 points.According to Kuratowski's theorem, the Petersen diagram is non-
planar.