Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A...
Transcript of Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A...
![Page 1: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/1.jpg)
Planar Graphs
Marc Culler
Planar Graphs – p. 1/??
![Page 2: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/2.jpg)
graphs
A (finite) graph G is a topological space with G = V ∪E where
V is a finite discrete set (vertices);
E is a finite disjoint union of open sets (edges);
For each edge e there is a continuous map [0, 1]→ Gmapping (0, 1) homeomorphically onto e and sending0, 1 to V .
Planar Graphs – p. 2/??
![Page 3: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/3.jpg)
graphs
A (finite) graph G is a topological space with G = V ∪E where
V is a finite discrete set (vertices);
E is a finite disjoint union of open sets (edges);
For each edge e there is a continuous map [0, 1]→ Gmapping (0, 1) homeomorphically onto e and sending0, 1 to V .
A subgraph of a graph is a closed subspace which is a union ofedges and vertices.
Planar Graphs – p. 2/??
![Page 4: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/4.jpg)
graphs
A (finite) graph G is a topological space with G = V ∪E where
V is a finite discrete set (vertices);
E is a finite disjoint union of open sets (edges);
For each edge e there is a continuous map [0, 1]→ Gmapping (0, 1) homeomorphically onto e and sending0, 1 to V .
A subgraph of a graph is a closed subspace which is a union ofedges and vertices.
The valence of a vertex v is the minimal number of componentsof an arbitrarily small deleted neighborhood of v .
Planar Graphs – p. 2/??
![Page 5: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/5.jpg)
graphs
A (finite) graph G is a topological space with G = V ∪E where
V is a finite discrete set (vertices);
E is a finite disjoint union of open sets (edges);
For each edge e there is a continuous map [0, 1]→ Gmapping (0, 1) homeomorphically onto e and sending0, 1 to V .
A subgraph of a graph is a closed subspace which is a union ofedges and vertices.
The valence of a vertex v is the minimal number of componentsof an arbitrarily small deleted neighborhood of v .
A cycle is a graph which is homeomorphic to a circle.
Planar Graphs – p. 2/??
![Page 6: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/6.jpg)
graphs
A (finite) graph G is a topological space with G = V ∪E where
V is a finite discrete set (vertices);
E is a finite disjoint union of open sets (edges);
For each edge e there is a continuous map [0, 1]→ Gmapping (0, 1) homeomorphically onto e and sending0, 1 to V .
A subgraph of a graph is a closed subspace which is a union ofedges and vertices.
The valence of a vertex v is the minimal number of componentsof an arbitrarily small deleted neighborhood of v .
A cycle is a graph which is homeomorphic to a circle.
Lemma. A graph which is not a cycle is homeomorphic to agraph without valence 2 vertices.
Planar Graphs – p. 2/??
![Page 7: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/7.jpg)
topology of S2
Planar Graphs – p. 3/??
![Page 8: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/8.jpg)
topology of S2
Theorem (Riemann Mapping). A connected open subset of S2
with (non-empty) connected complement is conformallyhomeomorphic to the open unit disk.
Planar Graphs – p. 3/??
![Page 9: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/9.jpg)
topology of S2
Theorem (Riemann Mapping). A connected open subset of S2
with (non-empty) connected complement is conformallyhomeomorphic to the open unit disk.
Theorem (Jordan-Schonflies). A simple closed curve in S2 isthe common boundary of two disks with disjoint interiors.
Planar Graphs – p. 3/??
![Page 10: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/10.jpg)
topology of S2
Theorem (Riemann Mapping). A connected open subset of S2
with (non-empty) connected complement is conformallyhomeomorphic to the open unit disk.
Theorem (Jordan-Schonflies). A simple closed curve in S2 isthe common boundary of two disks with disjoint interiors.
Theorem. Suppose that f is a conformal homeomorphism from
the open unit disk onto an open set Ω ⊂ S2. If the boundary ofΩ is locally connected, then f extends to a continuous mapdefined on the closed unit disk.
Planar Graphs – p. 3/??
![Page 11: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/11.jpg)
planar graphs
A graph is planar if it can be embedded in S2.
If G is embedded in S2 then the regions in the complement ofG are faces. If G is connected the faces are open disks.
Planar Graphs – p. 4/??
![Page 12: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/12.jpg)
planar graphs
A graph is planar if it can be embedded in S2.
If G is embedded in S2 then the regions in the complement ofG are faces. If G is connected the faces are open disks.
But the boundary of a face is not necessarily a cycle.
Planar Graphs – p. 4/??
![Page 13: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/13.jpg)
cut vertices
A vertex v of a graph G is a cut vertex if G is the union of twoproper subgraphs A and B with A ∩ B = v.
Planar Graphs – p. 5/??
![Page 14: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/14.jpg)
cut vertices
A vertex v of a graph G is a cut vertex if G is the union of twoproper subgraphs A and B with A ∩ B = v.
Proposition. Let G be a graph embedded in S2. Suppose F isa face of G and ∂F is not a cycle. Then ∂F contains a cutvertex of G.
Planar Graphs – p. 5/??
![Page 15: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/15.jpg)
cut vertices
A vertex v of a graph G is a cut vertex if G is the union of twoproper subgraphs A and B with A ∩ B = v.
Proposition. Let G be a graph embedded in S2. Suppose F isa face of G and ∂F is not a cycle. Then ∂F contains a cutvertex of G.
Planar Graphs – p. 5/??
![Page 16: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/16.jpg)
cut pairs
A pair u, v of vertices of a graph G is a cut pair if G is theunion of two proper subgraphs A and B, neither of which is anedge, so that A ∩ B = u, v.
Planar Graphs – p. 6/??
![Page 17: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/17.jpg)
cut pairs
A pair u, v of vertices of a graph G is a cut pair if G is theunion of two proper subgraphs A and B, neither of which is anedge, so that A ∩ B = u, v.
If G has no cut vertex, then A and B are connected.
Planar Graphs – p. 6/??
![Page 18: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/18.jpg)
cut pairs
A pair u, v of vertices of a graph G is a cut pair if G is theunion of two proper subgraphs A and B, neither of which is anedge, so that A ∩ B = u, v.
If G has no cut vertex, then A and B are connected.
A graph is 3-connected if it is connected, has no cut vertex andhas no cut pair.
Planar Graphs – p. 6/??
![Page 19: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/19.jpg)
boundaries of faces
Lemma. Let G be a planar graph and let C ⊂ G be a cycle.The cycle C is the boundary of a face for every embedding of G
in S2 if and only if G − C is connected.
Planar Graphs – p. 7/??
![Page 20: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/20.jpg)
boundaries of faces
Lemma. Let G be a planar graph and let C ⊂ G be a cycle.The cycle C is the boundary of a face for every embedding of G
in S2 if and only if G − C is connected.
Proof. If G − C is connected, then for any embedding of G in
S2, the connected set G − C is contained in one of the twodisks bounded by C. The other disk must be a face.
Planar Graphs – p. 7/??
![Page 21: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/21.jpg)
boundaries of faces
Lemma. Let G be a planar graph and let C ⊂ G be a cycle.The cycle C is the boundary of a face for every embedding of G
in S2 if and only if G − C is connected.
Proof. If G − C is connected, then for any embedding of G in
S2, the connected set G − C is contained in one of the twodisks bounded by C. The other disk must be a face.
Suppose G − C is disconnected. Write G as A ∪ B where A andB are subgraphs, neither one a cycle, such that A ∩ B = C.
Choose an embedding of G in S2. If C is not the boundary of aface, then we are done. Otherwise, restrict the embeddings toA and B, to obtain embeddings of A and B into disks, sendingC to the boundary of each disk. Gluing the boundaries of the
two disks together gives an embedding of G in S2 for which C isnot a face.
Planar Graphs – p. 7/??
![Page 22: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/22.jpg)
unique embeddings
Theorem (Whitney). A 3-connected planar graph has a unique
embedding, up to composition with a homeomorphism of S2.
Planar Graphs – p. 8/??
![Page 23: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/23.jpg)
unique embeddings
Theorem (Whitney). A 3-connected planar graph has a unique
embedding, up to composition with a homeomorphism of S2.
Proof. Say there are two embeddings of G in S2. Then somecycle C ⊂ G is the boundary of a face for one embedding, butnot the other. By the Lemma, G − C has at least twocomponents.
Planar Graphs – p. 8/??
![Page 24: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/24.jpg)
unique embeddings
Theorem (Whitney). A 3-connected planar graph has a unique
embedding, up to composition with a homeomorphism of S2.
Proof. Say there are two embeddings of G in S2. Then somecycle C ⊂ G is the boundary of a face for one embedding, butnot the other. By the Lemma, G − C has at least twocomponents. Look at an embedding where C is a face.
A component of G − C is in the complement of the facebounded by C. Planar Graphs – p. 8/??
![Page 25: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/25.jpg)
unique embeddings
Theorem (Whitney). A 3-connected planar graph has a unique
embedding, up to composition with a homeomorphism of S2.
Proof. Say there are two embeddings of G in S2. Then somecycle C ⊂ G is the boundary of a face for one embedding, butnot the other. By the Lemma, G − C has at least twocomponents.
The other components of G − C have to fit in the “gaps”.Planar Graphs – p. 8/??
![Page 26: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/26.jpg)
unique embeddings
Theorem (Whitney). A 3-connected planar graph has a unique
embedding, up to composition with a homeomorphism of S2.
Proof. Say there are two embeddings of G in S2. Then somecycle C ⊂ G is the boundary of a face for one embedding, butnot the other. By the Lemma, G − C has at least twocomponents.
Here is a cut pair.Planar Graphs – p. 8/??
![Page 27: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/27.jpg)
Kuratowski’s Theorem
A minimal non-planar graph is not planar, but every propersubgraph is planar.
Theorem (Kuratowski). Every minimal non-planar graph ishomeomorphic to either K(5) or K(3, 3).
Planar Graphs – p. 9/??
![Page 28: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/28.jpg)
Kuratowski’s Theorem
A minimal non-planar graph is not planar, but every propersubgraph is planar.
Theorem (Kuratowski). Every minimal non-planar graph ishomeomorphic to either K(5) or K(3, 3).
Planar Graphs – p. 9/??
![Page 29: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/29.jpg)
Euler characteristic
Suppose a connected graph in S2 has V vertices, E edges andF faces. Then
2 = χ(S2) = V − E + F.
Planar Graphs – p. 10/??
![Page 30: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/30.jpg)
Euler characteristic
Suppose a connected graph in S2 has V vertices, E edges andF faces. Then
2 = χ(S2) = V − E + F.
If every face has at least k edges on its boundary thenkF ≤ 2E, so
2 = V − E + F ≤ V − E +2
kE ⇒ E ≤
k
k − 2V −
2k
k − 2
If k = 3 then E ≤ 3V − 6. If k = 4 then E ≤ 2V − 4.
Planar Graphs – p. 10/??
![Page 31: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/31.jpg)
Euler characteristic
Suppose a connected graph in S2 has V vertices, E edges andF faces. Then
2 = χ(S2) = V − E + F.
If every face has at least k edges on its boundary thenkF ≤ 2E, so
2 = V − E + F ≤ V − E +2
kE ⇒ E ≤
k
k − 2V −
2k
k − 2
If k = 3 then E ≤ 3V − 6. If k = 4 then E ≤ 2V − 4.
For K(5) we can take k = 3 and we have V = 5 butE = 10 > 15− 6.
For K(3, 3) we can take k = 4 and we have V = 6 butE = 9 > 12− 4.
So these are non-planar graphs.Planar Graphs – p. 10/??
![Page 32: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/32.jpg)
no cut vertex
Lemma. A minimal non-planar graph G has no cut vertex.
Proof. Suppose G = A∪B, A∩B = v. By minimality, A andB are planar. Embed A in a closed disk, so that v lies on theboundary. Do the same for B. Then embed the two disks sothey meet at v .
Planar Graphs – p. 11/??
![Page 33: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/33.jpg)
no cut vertex
Lemma. A minimal non-planar graph G has no cut vertex.
Proof. Suppose G = A∪B, A∩B = v. By minimality, A andB are planar. Embed A in a closed disk, so that v lies on theboundary. Do the same for B. Then embed the two disks sothey meet at v .
Planar Graphs – p. 11/??
![Page 34: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/34.jpg)
no cut pair
Lemma. A minimal non-planar graph G has no cut pair.
Proof. Suppose G = A ∪ B, A ∩ B = u, v. Since G has nocut vertex, A and B are connected. Claim: A can be embeddedin S2 so that u and v are in the boundary of the same face.(Likewise for B.)
Planar Graphs – p. 12/??
![Page 35: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/35.jpg)
no cut pair
Lemma. A minimal non-planar graph G has no cut pair.
Proof. Suppose G = A ∪ B, A ∩ B = u, v. Since G has nocut vertex, A and B are connected. Claim: A can be embeddedin S2 so that u and v are in the boundary of the same face.(Likewise for B.) Join u to v by an arc b ⊂ B.
Planar Graphs – p. 12/??
![Page 36: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/36.jpg)
no cut pair
Lemma. A minimal non-planar graph G has no cut pair.
Proof. Suppose G = A ∪ B, A ∩ B = u, v. Since G has nocut vertex, A and B are connected. Claim: A can be embeddedin S2 so that u and v are in the boundary of the same face.(Likewise for B.) Join u to v by an arc b ⊂ B. By minimality
A ∪ b is planar. Embed A ∪ b in S2.
Planar Graphs – p. 12/??
![Page 37: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/37.jpg)
no cut pair
Lemma. A minimal non-planar graph G has no cut pair.
Proof. Suppose G = A ∪ B, A ∩ B = u, v. Since G has nocut vertex, A and B are connected. Claim: A can be embeddedin S2 so that u and v are in the boundary of the same face.(Likewise for B.) Join u to v by an arc b ⊂ B. By minimality
A ∪ b is planar. Embed A ∪ b in S2. Now remove the arc b.
Planar Graphs – p. 12/??
![Page 38: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/38.jpg)
no cut pair, cont’d
To finish the proof of the lemma, embed A in a disk so that uand v lie on the boundary. Do the same for B.
Planar Graphs – p. 13/??
![Page 39: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/39.jpg)
no cut pair, cont’d
To finish the proof of the lemma, embed A in a disk so that uand v lie on the boundary. Do the same for B.
Then embed the two disks so they meet at u and v . This is acontradiction since G is non-planar.
¤
Planar Graphs – p. 13/??
![Page 40: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/40.jpg)
the graph G′
Let G be a minimal non-planar graph with no valence 2 vertices.Remove an arbitrary edge e with endpoints x and y . Call the
resulting planar graph G′. Embed G′ in S2.
Planar Graphs – p. 14/??
![Page 41: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/41.jpg)
the graph G′
Let G be a minimal non-planar graph with no valence 2 vertices.Remove an arbitrary edge e with endpoints x and y . Call the
resulting planar graph G′. Embed G′ in S2.
The graph G′ has no cut vertex.
Planar Graphs – p. 14/??
![Page 42: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/42.jpg)
the graph G′
Let G be a minimal non-planar graph with no valence 2 vertices.Remove an arbitrary edge e with endpoints x and y . Call the
resulting planar graph G′. Embed G′ in S2.
The graph G′ has no cut vertex.
If x is a cut vertex for G′, then x is a cut vertex for G. Likewisefor y .
Planar Graphs – p. 14/??
![Page 43: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/43.jpg)
the graph G′
Let G be a minimal non-planar graph with no valence 2 vertices.Remove an arbitrary edge e with endpoints x and y . Call the
resulting planar graph G′. Embed G′ in S2.
The graph G′ has no cut vertex.
If G has a cut vertex v distinct from x and y , then x and y areseparated by v and x, v is a cut pair for G.
Planar Graphs – p. 14/??
![Page 44: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/44.jpg)
the graph G′
Let G be a minimal non-planar graph with no valence 2 vertices.Remove an arbitrary edge e with endpoints x and y . Call the
resulting planar graph G′. Embed G′ in S2.
The graph G′ has no cut vertex.
The graph G′ may have cut pairs, but no cut pair can contain x .
If x, v is a cut pair for G′ then it is a cut pair for G as well.
Planar Graphs – p. 14/??
![Page 45: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/45.jpg)
the wheel
Consider the graph G′ ⊂ S2. Construct a graph G′′ ⊂ S2 byerasing the vertex x and the edges that meet it. Let R be theboundary of the face of G′′ containing the point x . Claim: R isa cycle.
Planar Graphs – p. 15/??
![Page 46: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/46.jpg)
the wheel
Consider the graph G′ ⊂ S2. Construct a graph G′′ ⊂ S2 byerasing the vertex x and the edges that meet it. Let R be theboundary of the face of G′′ containing the point x . Claim: R isa cycle. Otherwise R would contain a cut vertex v for G′′.
Planar Graphs – p. 15/??
![Page 47: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/47.jpg)
the wheel
Consider the graph G′ ⊂ S2. Construct a graph G′′ ⊂ S2 byerasing the vertex x and the edges that meet it. Let R be theboundary of the face of G′′ containing the point x . Claim: R isa cycle. Otherwise R would contain a cut vertex v for G′′.
But then x and v would form a cut pair for G, a contradiction.
Planar Graphs – p. 15/??
![Page 48: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/48.jpg)
the wheel
Consider the graph G′ ⊂ S2. Construct a graph G′′ ⊂ S2 byerasing the vertex x and the edges that meet it. Let R be theboundary of the face of G′′ containing the point x . Claim: R isa cycle. Otherwise R would contain a cut vertex v for G′′.We conclude that x ∪ R together with all the edges of G′
incident to x , form a wheel graph W inside of G′.
Planar Graphs – p. 15/??
![Page 49: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/49.jpg)
the straddle
Let Y be the component of G′ −W which contains y .
Claim: Y meets at least two sectors of the wheel W .
Planar Graphs – p. 16/??
![Page 50: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/50.jpg)
the straddle
Let Y be the component of G′ −W which contains y .
Claim: Y meets at least two sectors of the wheel W . Suppose
not. Then all of the points of Y ∩R are contained in one sectorS.
Planar Graphs – p. 16/??
![Page 51: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/51.jpg)
the straddle
Let Y be the component of G′ −W which contains y .
Claim: Y meets at least two sectors of the wheel W . Suppose
not. Then all of the points of Y ∩R are contained in one sectorS. Consider the (planar) graph Z = S ∪ Y ∪ e.
Planar Graphs – p. 16/??
![Page 52: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/52.jpg)
the straddle
Let Y be the component of G′ −W which contains y .
Claim: Y meets at least two sectors of the wheel W . Suppose
not. Then all of the points of Y ∩R are contained in one sectorS. Consider the (planar) graph Z = S ∪ Y ∪ e.
Since Z − S is connected, every embedding of Z has S as aface. So we can embed Z inside of S. This gives a planarembedding of G, a contradiction.
Planar Graphs – p. 16/??
![Page 53: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/53.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 54: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/54.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 55: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/55.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 56: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/56.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 57: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/57.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 58: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/58.jpg)
case 1
Suppose Y meets R in a vertex which is not an endpoint of aspoke.
Planar Graphs – p. 17/??
![Page 59: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/59.jpg)
case 2
Suppose Y meets R in exactly two endpoints of spokes.
Planar Graphs – p. 18/??
![Page 60: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/60.jpg)
case 2
Suppose Y meets R in exactly two endpoints of spokes.
Planar Graphs – p. 18/??
![Page 61: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/61.jpg)
case 2
Suppose Y meets R in exactly two endpoints of spokes.
Planar Graphs – p. 18/??
![Page 62: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/62.jpg)
case 2
Suppose Y meets R in exactly two endpoints of spokes.
Planar Graphs – p. 18/??
![Page 63: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/63.jpg)
case 2
Suppose Y meets R in exactly two endpoints of spokes.
Planar Graphs – p. 18/??
![Page 64: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/64.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??
![Page 65: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/65.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??
![Page 66: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/66.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??
![Page 67: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/67.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??
![Page 68: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/68.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??
![Page 69: Planar Graphs – p. 1/??homepages.math.uic.edu/~culler/talks/planargraphs.pdf · graphs A (finite) graph G is a topological space with G = V ∪˙E where V is a finite discrete](https://reader033.fdocuments.net/reader033/viewer/2022043020/5f3c2ee681c6340ccc5154f8/html5/thumbnails/69.jpg)
case 3
Suppose Y meets R in three or more endpoints of spokes.
Planar Graphs – p. 19/??