期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：5
出版社：S.S. Mishra
摘要：If a geometric representation of a graph G can be drawn on a plane in such a way that no two edges of G intersect each other ,then G is said a planar graph. In this paper an approach to devise a planar graph using Kuratowski's two non-planar graph K5 (with minimum number of vertices) and K3,3(with minimum number of edges) is being proposed. A corollary for connected planar graph G having f regions, n vertices and e edges is also being proved as a witness of planarity.
关键词：Planar Graph; Non Planar Graph; Kuratowski's K5 and K3;3 Non Planar Graph; Tangle
