Date of Award
12-2016
Document Type
Thesis
Degree Name
Master of Arts in Mathematics
Department
Mathematics
First Reader/Committee Chair
Aikin, Jeremy
Abstract
A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar subgraph and the blue edges induce a planar subgraph. In this thesis, we determine the smallest complete and complete bipartite graphs that are not biplanar.
Recommended Citation
Hearon, Sean M., "PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS" (2016). Electronic Theses, Projects, and Dissertations. 427.
https://scholarworks.lib.csusb.edu/etd/427