Abstract
A graph is called planar if it can be represented on the plane without points of intersection
of lines. It is clear from the title that this study is concerned with the characterization
of such graphs.
In Paragraph 1.2 notation and terminology that are needed throughout, are defined.
Specialized notation and terminology are defined when needed.
Chapter 2 is concerned with the characterization of planar graphs in terms of forbidden
subgraphs. In this regard, specific attention is given to a proof of the Theorem of
Kuratowski. In Chapter 3 we prove the characterizations of planar graphs in terms of
partially ordered sets of Schnyder and Scheinerman. In Chapter 4 a few characterizations
of planar graphs (without proof) are presented. These results of planar graphs are used
collectively to state a characterization in Paragraph 4.3.
M.A. (Mathematics)