vertices edges - math.mcmaster.ca
Transcript of vertices edges - math.mcmaster.ca
![Page 1: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/1.jpg)
![Page 2: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/2.jpg)
vertices
edges
![Page 3: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/3.jpg)
Proper
Colouring
![Page 4: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/4.jpg)
Proper
Colouring
Improper
Colouring
![Page 5: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/5.jpg)
Can a geographical map be coloured using
only 4 colours?
![Page 6: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/6.jpg)
In 1878, A. Cayley represented the four colour problem
using vertices and edges.
Country
Border between countries
![Page 7: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/7.jpg)
Any triangle-free planar graph can be
properly coloured using at most 3 colours.
![Page 8: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/8.jpg)
Any triangle-free planar graph can be
properly coloured using at most 3 colours.
Triangle-free Not triangle-free
![Page 9: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/9.jpg)
Any triangle-free planar graph can be
properly coloured using at most 3 colours.
Triangle-free
Not triangle-free
![Page 10: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/10.jpg)
![Page 11: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/11.jpg)
![Page 12: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/12.jpg)
![Page 13: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/13.jpg)
![Page 14: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/14.jpg)
Not a proper colouring!
![Page 15: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/15.jpg)
Any triangle-free planar graph can be
properly coloured using at most 3 colours.
Planar Non-Planar
![Page 16: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/16.jpg)
![Page 17: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/17.jpg)
![Page 18: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/18.jpg)
![Page 19: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/19.jpg)
Triangle-free, but not
3-colourable!
![Page 20: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/20.jpg)
•Any triangle-free planar graph G is 3-colourable.
• Moreover, if the boundary of the outer face of
G is a cycle C of length at most 6, then any
safe 3 -colouring of the boundary can be
extended to a 3-colouring of G.
L. Kowalik
![Page 21: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/21.jpg)
Safe (p,b,o,b,p,o)
Not Safe (p,b,o,p,b,o)
![Page 22: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/22.jpg)
L. Kowalik
• Induction on n, the number of vertices in G.
• Assume true for n-1 or fewer vertices.
![Page 23: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/23.jpg)
G has an uncoloured vertex v with degree at most 2.
![Page 24: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/24.jpg)
G has an uncoloured vertex v with degree at most 2.
Remove v.
![Page 25: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/25.jpg)
G has an uncoloured vertex v with degree at most 2.
Induction.
![Page 26: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/26.jpg)
G has an uncoloured vertex v with degree at most 2.
Put v back
in G.
![Page 27: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/27.jpg)
G has an uncoloured vertex v with degree at most 2.
Colour v with an
available colour.
![Page 28: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/28.jpg)
The boundary C is coloured and has a chord.
C has size 6 and is
safely coloured.
![Page 29: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/29.jpg)
If C has a chord,
it must have size
6, because
otherwise there
would be a
triangle in G.
The boundary C is coloured and has a chord.
![Page 30: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/30.jpg)
The boundary C is coloured and has a chord.
C has size 6 and is
safely coloured.
![Page 31: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/31.jpg)
Colour P by
induction. 1
The boundary C is coloured and has a chord.
![Page 32: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/32.jpg)
The boundary C is coloured and has a chord.
![Page 33: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/33.jpg)
Colour P by
induction. 2
The boundary C is coloured and has a chord.
![Page 34: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/34.jpg)
The boundary C is coloured and has a chord.
G is properly
coloured.
![Page 35: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/35.jpg)
S is a separating
cycle.
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
![Page 36: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/36.jpg)
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
Removing S
disconnects the
graph.
![Page 37: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/37.jpg)
S is a separating
cycle.
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
![Page 38: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/38.jpg)
First colour
everything except
the interior of S
by induction.
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
![Page 39: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/39.jpg)
Now colour S and
its interior by
induction.
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
![Page 40: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/40.jpg)
G is now properly
coloured.
If G has a separating cycle S, where S has size at most 6,
then we can complete the proof by induction.
![Page 41: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/41.jpg)
Identifying vertices makes the graph G smaller, and allows
us to use induction.
![Page 42: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/42.jpg)
Identifying vertices makes the graph G smaller, and allows
us to use induction.
![Page 43: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/43.jpg)
Identifying vertices makes the graph G smaller, and allows
us to use induction.
Must make sure
that identifying
does not create
a chord
through the
boundary C, or
a triangle.
![Page 44: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/44.jpg)
Kowalik uses these techniques when considering
each of the following cases:
• G has a face of size 6 or greater.
• G has a face of size 4.
• G has a face of size 5.
Once all of these cases are considered, the proof is
complete.
![Page 45: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/45.jpg)
- A type of graph colouring in which each vertex is
assigned a list of potential colours.
![Page 46: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/46.jpg)
• each vertex has a list size of at most k
• G can be properly coloured regardless
of which colours are assigned to each
vertex’s k-sized list.
![Page 47: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/47.jpg)
Regular colouring is a special case of list colouring where
each vertex is assigned the same list of colours.
![Page 48: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/48.jpg)
Regular colouring is a special case of list colouring where
each vertex is assigned the same list of colours.
2-colourable!
![Page 49: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/49.jpg)
![Page 50: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/50.jpg)
![Page 51: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/51.jpg)
![Page 52: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/52.jpg)
![Page 53: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/53.jpg)
Improper
colouring!
![Page 54: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/54.jpg)
Improper
colouring!
![Page 55: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/55.jpg)
![Page 56: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/56.jpg)
![Page 57: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/57.jpg)
![Page 58: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/58.jpg)
Improper
colouring!
![Page 59: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/59.jpg)
Improper
colouring!
![Page 60: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/60.jpg)
Not 2-list
colourable!
![Page 61: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/61.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
v
![Page 62: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/62.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
v
Colour v.
![Page 63: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/63.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
v
Delete v’s colour
from its
neighbours’ lists.
![Page 64: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/64.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
Delete v.
![Page 65: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/65.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
Colour by
induction.
![Page 66: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/66.jpg)
• Non-list colouring forces you to rely on the
known properties of planar graphs.
• List colouring allows you to manipulate the size
of a list:
v
Add v back in.
![Page 67: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/67.jpg)
Any triangle-free planar graph G is 3-colourable.
C. Thomassen
![Page 68: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/68.jpg)
Any planar graph without triangles and without
4-cycles is 3-list-colourable.
![Page 69: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/69.jpg)
Any planar graph without triangles and without
4-cycles is 3-list-colourable.
and is therefore
3 colourable!
![Page 70: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/70.jpg)
• Planar
• No triangles or 4-cycles.
• The only coloured part of G is a 3-colouring
of a path P on the boundary C, where P has
at most 6 vertices.
![Page 71: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/71.jpg)
• All vertices not in C are list-3 vertices.
• All vertices in C are list-2 or list-3, except
the coloured vertices of P (which are list-1).
• There is no edge joining vertices whose list
have size less than 3 (except for the edges in
P).
![Page 72: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/72.jpg)
coloured
list-3
list-2
![Page 73: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/73.jpg)
coloured
P
list-3
list-2
![Page 74: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/74.jpg)
coloured
list-3
list-2
may be a list-2
or a list-3 vertex.
![Page 75: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/75.jpg)
coloured
list-3
list-2
Suppose is a
list-3 vertex.
![Page 76: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/76.jpg)
coloured
list-3
list-2
Delete , and
delete its colour
from its
neighbours’ lists.
![Page 77: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/77.jpg)
coloured
list-3
list-2
Check to make
sure the
properties of G
still hold, then
colour by
induction.
![Page 78: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/78.jpg)
coloured
list-3
list-2
Check to make
sure the
properties of G
still hold, then
colour by
induction.
![Page 79: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/79.jpg)
coloured
list-3
list-2
Put back into
G.
![Page 80: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/80.jpg)
coloured
list-3
list-2
Now suppose
is a list-2 vertex.
![Page 81: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/81.jpg)
must be a
list-3 vertex.
coloured
list-3
list-2
![Page 82: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/82.jpg)
Complete the
proof by
considering what
happens when
is a list-3, and
when it is a list-2.
coloured
list-3
list-2
![Page 83: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/83.jpg)
(Theorem 1)
(Theorem 1)
Rules out :
• G has no 4-cycles.
• Separating 4-cycles.
• Interior facial 4-cycles.
• C is a 4-cycle.
Any triangle-free planar graph G is 3-colourable.
C. Thomassen
![Page 84: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/84.jpg)
• At most 3 triangles. B. Grünbaum (1963)
A planar graph G is 3-colourable if there are:
![Page 85: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/85.jpg)
• At most 3 triangles.
• No 5-cycles and all triangles are at least 2
vertices away from each other.
B. Grünbaum (1963)
Borodin, Raspaud (2000)
A planar graph G is 3-colourable if there are:
![Page 86: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/86.jpg)
• At most 3 triangles.
• No 5-cycles and all triangles are at least 2
vertices away from each other.
• No 5-cycles, no 7-cycles, and no triangles
share a common vertex.
B. Grünbaum (1963)
Borodin, Glebov (2010)
Baogang Xu (2006)
A planar graph G is 3-colourable if there are:
![Page 87: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/87.jpg)
Torus:
Generalize Grötzsch’s Theorem for more
complicated surfaces:
![Page 88: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/88.jpg)
Generalize Grötzsch’s Theorem for more
complicated surfaces:
Torus:
![Page 89: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/89.jpg)
Torus: 3-colourable in G if it has no triangles
and no quadrilaterals.
C. Thomassen (1994)
![Page 90: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/90.jpg)
By using a result recently obtained by Thomassen and Kawarabayashi (2009): every planar graph can be decomposed into an independent set and a forest.
Torus: 3-colourable in G if it has no triangles
and no quadrilaterals.
• Generalize this to perhaps allow for triangles
at minimum distance k.
C. Thomassen (1994)
![Page 91: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/91.jpg)
![Page 92: vertices edges - math.mcmaster.ca](https://reader030.fdocuments.net/reader030/viewer/2022012007/61d98727619820443d02c2d3/html5/thumbnails/92.jpg)
V: number of vertices F: number of faces M: number of edges
Euler’s Formula: V + F – M = 2
2M = =
iffaces
if ||
ivvertices
iv )deg(