PIMS- UVic Discrete Math Seminar: Kieka Mynhardt
Date
-
Topic
Two Equivalent Results on Plane Triangulations
Speakers
Details
It is well known that a maximal planar graph of order at least 3 is 3-colourable if and only if it is Eulerian. It is also known that if a maximal planar graph of order at least 3 has exactly two vertices of odd degree, then these vertices are nonadjacent. I will show that these two results are equivalent.
The talk should be accessible to undergraduate students with a basic knowledge of graph theory.
Additional Information
Location: COR A121