PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
CSUSB ScholarWorks
2016
|
| Subjects: | |
| Online Access: | https://scholarworks.lib.csusb.edu/etd/427 https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=1485&context=etd |