PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS

<p>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.</p>

Name thesis:degree_name

Master of Arts in Mathematics

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Mathematics

Year dc:date.available

2016

Author dc:creator

• Hearon, Sean M

Contributors dc:contributor

• Aikin, Jeremy

• Graphs
• Combinatorics
• Planar
• Biplanar
• Graph thickness
• Discrete Mathematics and Combinatorics

Repository record dc:identifier

https://scholarworks.lib.csusb.edu/etd/427

OAI identifier oai:identifier

oai:scholarworks.lib.csusb.edu:etd-1485