canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs...
TRANSCRIPT
![Page 1: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/1.jpg)
Canonical Decomposition, Realizer,Schnyder Labeling
and Orderly Spanning Trees of Plane Graphs
Kazuyuki Miura, Machiko Azuma and Takao Nishizeki
title
![Page 2: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/2.jpg)
Convex grid drawingconvex drawing
1:all vertices are put on grid points 2:all edges are drawn as straight line segments 3:all faces are drawn as convex polygons
![Page 3: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/3.jpg)
1. canonical decomposition 2. realizer3. Schnyder labeling
drawing methods
Convex grid drawing
![Page 4: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/4.jpg)
method (cd)
V1
V2 V3
V4
V5V6
V7
V 8
Canonical Decomposition [CK97]
[CK97]
convex grid drawing
How to construct a convex grid drawing
outer triangular
ordered partition convex grid drawing but not outer triangularconvex grid drawing
![Page 5: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/5.jpg)
method (re)
Realizer [DTV99]
How to construct a convex grid drawing
[Fe01]
outer triangular convex grid drawing
![Page 6: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/6.jpg)
method (sl)
Schnyder labeling [Sc90,Fe01]
21
3
1 11
2233
1
2 3
3
3
3
1
233
3
2
2 2111
12
12
31
2
3
1 2 31
23
21
2
3
How to construct a convex grid drawing
outer triangular convex grid drawing
[Fe01]
![Page 7: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/7.jpg)
relations
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Convex Grid Drawing
Are there any relations between these concepts?
Are there any relations between these concepts?
Question 1 Question 1
![Page 8: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/8.jpg)
known result
[BTV99]
Realizer
[Fe01]
Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
[Fe01]
Known results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
3-connectivity is a sufficient condition 3-connectivity is a sufficient condition
![Page 9: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/9.jpg)
[BTV99]
Realizer
[Fe01]
Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
[Fe01]
Known results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
What is the necessary and sufficient condition?What is the necessary and sufficient condition?
Question 2 Question 2
![Page 10: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/10.jpg)
[BTV99]
Realizer
[Fe01]
Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Known results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition[Fe01]
Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree [CLL01]
![Page 11: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/11.jpg)
applicationApplications of a canonical decomposition a realizer a Schnyder labeling an orderly spanning tree
convex grid drawing
floor-planning
graph encoding
2-visibility drawing
etc.
![Page 12: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/12.jpg)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
our result
Are there any relations between these concepts?
Are there any relations between these concepts?
Question 1 Question 1
What is the necessary and sufficient condition?What is the necessary and sufficient condition?
Question 2 Question 2
![Page 13: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/13.jpg)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
these five notions are equivalent with each other
What is the necessary and sufficient condition?What is the necessary and sufficient condition?
Question 2 Question 2
![Page 14: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/14.jpg)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
these five notions are equivalent with each other
a necessary and sufficient conditionfor plane graphs for their existence
![Page 15: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/15.jpg)
theorem
Theorem G : plane graph with each degree ≥ 3
(a) - (f) are equivalent with each other.
(a) G has a canonical decomposition.
(b) G has a realizer.
(c ) G has a Schnyder labeling.
(d) G has an outer triangular convex grid drawing.
(e) G has an orderly spanning tree.
( f ) necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v } such that both u and v are on the same Pi (1 ≤ i ≤ 3).
![Page 16: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/16.jpg)
each degree ≥ 3
necessary and sufficient condition(f) Our necessary and sufficient condition
P1
P2P3
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3).
![Page 17: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/17.jpg)
each degree ≥ 3
P1
P2P3
-1. internally 3-connected(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3). For any separation pair {u,v} of G ,
1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
For any separation pair {u,v} of G , 1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
G
separation pairu
v
G - {u,v}
![Page 18: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/18.jpg)
each degree ≥ 3
P1
P2P3
(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3). For any separation pair {u,v} of G ,
1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
For any separation pair {u,v} of G , 1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
Gseparation pairu
v
G - {u,v}
![Page 19: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/19.jpg)
each degree ≥ 3
P1
P2P3
(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3). For any separation pair {u,v} of G ,
1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
For any separation pair {u,v} of G , 1) both u and v are outer vertices, and 2) each component of G - {u,v} contains an outer vertex.
![Page 20: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/20.jpg)
each degree ≥ 3
P1
P2P3
(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3).
-2. separation pair on Pi
v
u
![Page 21: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/21.jpg)
each degree ≥ 3
P1
P2P3
(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3). v
u
![Page 22: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/22.jpg)
each degree ≥ 3
P1
P2P3
(f) Our necessary and sufficient condition
•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same path Pi (1 ≤ i ≤ 3).
P3
P1
P2u
v
![Page 23: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/23.jpg)
theorem
Theorem G : plane graph with each degree ≥ 3
(a) - (f) are equivalent with each other.
(a) G has a canonical decomposition.
(b) G has a realizer.
(c ) G has a Schnyder labeling.
(d) G has an outer triangular convex grid drawing.
(e) G has an orderly spanning tree.
( f ) necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v } such that both u and v are on the same Pi (1 ≤ i ≤ 3).
![Page 24: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/24.jpg)
(outline : convexdraw=>ns)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition[Fe01]
Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
our result
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
![Page 25: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/25.jpg)
G has an outer triangular convex grid drawing
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G has no outer triangular convex grid drawing
•G is not internally 3-connected , or•G has a separation pair {u,v} such that both u and v are on the same Pi (1 ≤ i ≤ 3)
if
These faces cannot be simultaneously drawnas convex polygons.
G has no convex drawing.
![Page 26: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/26.jpg)
G has an outer triangular convex grid drawing
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G has no outer triangular convex grid drawing
•G is not internally 3-connected , or•G has a separation pair {u,v} such that both u and v are on the same Pi (1 ≤ i ≤ 3)
if
u
v
This face cannot be drawn as a convex polygon.
G has no outer triangularconvex grid drawing.
![Page 27: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/27.jpg)
(outline : ns =>cd )
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
our result
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
[Fe01]
![Page 28: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/28.jpg)
P3
P2
G has a canonical decomposition
G
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
V8
V7
V6V5
V4
V3V2
V1P1
![Page 29: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/29.jpg)
V1
P3
P2
G has a canonical decomposition
G
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
V8
V7
V6V5
V4
V3V2
P1
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
![Page 30: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/30.jpg)
V1
VhG
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
![Page 31: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/31.jpg)
V1
VhG
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
V7
V6V5
V4
V3V2
![Page 32: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/32.jpg)
V1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G
V5
V4
V3V2
5
![Page 33: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/33.jpg)
V1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G1
![Page 34: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/34.jpg)
V1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G
V2
2
![Page 35: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/35.jpg)
V1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd1) V1 consists of all vertices on the inner face containing , and Vh={ }.(cd2) Each Gk (1 ≤ k ≤ h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G
V3V2
3
![Page 36: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/36.jpg)
h
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G=GVh
G k-1
(a)
Vk
G k-1
(b)
Vk
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
![Page 37: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/37.jpg)
V h-1
Gh-1
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 38: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/38.jpg)
Gh-2
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
V h-2
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 39: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/39.jpg)
Gh-3
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
Vh-3
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 40: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/40.jpg)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
G k-1
(a)
Vk
G k-1
(b)
Vk
GV
8
V7
V6V5
V4
V3V2
V1
![Page 41: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/41.jpg)
(outline : ostrealizer)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
[Fe01]
![Page 42: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/42.jpg)
Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Convex Grid Drawing
[Fe01]
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
Realizer
![Page 43: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/43.jpg)
ost
Orderly Spanning Tree
2
3
4
5 6
1preorder
78
9 10
11
12
n =13
parent
smaller
children
largerv
![Page 44: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/44.jpg)
realizer
Realizer
for each vertex
![Page 45: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/45.jpg)
(outline : re =>ost )
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} such that both u and v are on the same path Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
[Fe01]
![Page 46: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/46.jpg)
Realizer
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
parent
smaller
children
largerv
![Page 47: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/47.jpg)
(outline : ost =>re )
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Our results
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} such that both u and v are on the same path Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
[Fe01]
![Page 48: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/48.jpg)
Realizer
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
v
![Page 49: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/49.jpg)
Realizer
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
vv
![Page 50: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/50.jpg)
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
Realizer
vv
![Page 51: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/51.jpg)
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
Realizer
vv
![Page 52: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/52.jpg)
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
Realizer
vv
![Page 53: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/53.jpg)
Orderly Spanning Tree
1
2
3
4
5 6 78
9 10
11
12
13
RealizerRealizer
vv
![Page 54: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/54.jpg)
Realizer Schnyder labeling
213
1 11
2233
1
2 3
333
1
233
3
2
2 2111
12
12
312
3
1 2 31
23
212
3
Conclusion
V1
V2 V3V4
V5V6
V7
V8
Canonical Decomposition Convex Grid Drawing
1
2
3
4
5 6 78
9 10
11
12
13
Orderly Spanning Tree
necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v} such that both u and v are on the same path Pi (1 ≤ i ≤ 3).
[BTV99]
[Fe01]
[Fe01]
![Page 55: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/55.jpg)
theorem
Theorem G : plane graph with each degree ≥ 3
(a) - (f) are equivalent with each other.
(a) G has a canonical decomposition.
(b) G has a realizer.
(c ) G has a Schnyder labeling.
(d) G has an outer triangular convex grid drawing.
(e) G has an orderly spanning tree.
( f ) necessary and sufficient condition•G is internally 3-connected.•G has no separation pair {u,v } such that both u and v are on the same Pi (1 ≤ i ≤ 3).
![Page 56: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/56.jpg)
If a plane graph G satisfies the necessary and sufficient condition,then one can find the followings in linear time
(a) canonical decomposition, (b) realizer, (c) Schnyder labeling, (d) orderly spanning tree, and (e) outer triangular convex grid drawing of G having the size (n -1)×(n -1).
Corollary G : plane graph with each degree ≥ 3
3-connectednot 3-connected
![Page 57: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/57.jpg)
remaining problem
The remaining problem is to characterize the class of plane graphs having convex grid drawings such that the size is (n -1)×(n -1) and the outer face is not always a triangle.
triangle pentagon
![Page 58: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/58.jpg)
E N D
![Page 59: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/59.jpg)
---------------------
![Page 60: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/60.jpg)
![Page 61: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/61.jpg)
Orderly Spanning Tree ost-def
1
2
3
4
5 6 78
9 10
11
1213
r
u u
parent
smaller
children
larger
(each subset may be empty)
N1
N2
N3
N4
(ost2) For each leaf other than u and u , neither N2 nor N4 is empty.
(ost1) For each edge not in the tree T, none of the endpoints is an ancestor of the other in T.
![Page 62: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/62.jpg)
![Page 63: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/63.jpg)
1u 2u
Gi
F
FP
choose subset
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 64: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/64.jpg)
1u 2u
Gi
FP
Case 1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 65: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/65.jpg)
1u 2u
Gi
P
Case 1 Vi
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 66: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/66.jpg)
1u 2u
Gi
P
Case 1
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 67: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/67.jpg)
1u 2u
Gi
Case 2
FP
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 68: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/68.jpg)
1u 2u
Gi
Case 2
FP
u v
P2
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 69: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/69.jpg)
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
2u
Gi
Case 2
FP
1u
u vP3
G has a canonical decomposition
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 70: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/70.jpg)
1u 2u
Gi
Case 2
FP
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 71: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/71.jpg)
2u
Gi
Case 2
FP
1u
Vi
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 72: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/72.jpg)
2u
Gi
Case 2
FP
1u
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
(cd2) Each Gk (1≤k≤h) is internally 3-connected.(cd3) All the vertices in each Vk (2 ≤ k ≤ h -1) are outer vertices of Gk , and either (a) or (b).
G k-1
(a)
Vk
G k-1
(b)
Vk
![Page 73: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/73.jpg)
![Page 74: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/74.jpg)
chord-path
chord-path P
1. P connects two outer vertices u and v.2. u,v is a separation pair of G.3. P lies on an inner face. 4. P does not pass through any outer edge and any outer vertex other than u and v.
u v
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
![Page 75: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/75.jpg)
chord-path P
u
v
u
vu
v
u
v
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
1. P connects two outer vertices u and v.2. u,v is a separation pair of G.3. P lies on an inner face. 4. P does not pass through any outer edge and any outer vertex other than u and v.
![Page 76: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/76.jpg)
chord-path P
w1
w2
wt
minimal
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
1. P connects two outer vertices u and v.2. u,v is a separation pair of G.3. P lies on an inner face. 4. P does not pass through any outer edge and any outer vertex other than u and v.
![Page 77: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/77.jpg)
chord-path P
w1
w2
wt
minimal
find a minimal chord-path P,then choose such a vertex set.
plan of proof :
G has a canonical decomposition
•G is internally 3-connected•G has no separation pair {u,v} s.t. both u and v are on the same Pi (1 ≤ i ≤ 3)
1. P connects two outer vertices u and v.2. u,v is a separation pair of G.3. P lies on an inner face. 4. P does not pass through any outer edge and any outer vertex other than u and v.
![Page 78: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/78.jpg)
![Page 79: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/79.jpg)
3-connected plane graph3-connected plane graph
![Page 80: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/80.jpg)
3-connected plane graph
![Page 81: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title](https://reader036.vdocuments.mx/reader036/viewer/2022062517/56649ec65503460f94bd1eaa/html5/thumbnails/81.jpg)
3-connected plane graph