Kuratowski's Theorem
| dc.contributor.advisor | Yirgalem, Advisor (PhD) | |
| dc.contributor.author | Atlaw, Tesfu | |
| dc.date.accessioned | 2018-07-19T06:14:17Z | |
| dc.date.accessioned | 2023-11-04T12:30:39Z | |
| dc.date.available | 2018-07-19T06:14:17Z | |
| dc.date.available | 2023-11-04T12:30:39Z | |
| dc.date.issued | 2015-03 | |
| dc.description.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. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9308 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Kuratowski's Theorem | en_US |
| dc.title | Kuratowski's Theorem | en_US |
| dc.type | Thesis | en_US |