Kuratowski's Theorem
No Thumbnail Available
Date
2015-03
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
A graph is said to be planar if it can be drown in the plane so that no two edges intersect except
(possibly) at their ends vertices.It is of practical interest to able to determine whether a graph is
planar or not, our interest is how to check whether the graph is planar or not . In this project
we present the proof of Kuratowski's theorem on planarity of graph and discuss examples on the
application of the theorem.
Description
Keywords
Kuratowski's Theorem