Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in arbitrary planar graphs and other graphs with less restricted structure. This work explores planar separators and the planar separator theorem, as well as the existence of separators in the class of high genus near-planar graphs. These graphs have unbounded genus, where additionally the edges that cross each other are located near each other in the graph. Several diﬀerent graph classes that are high genus near-planar graphs are investigated for their feasibility for an extended separator theorem result.
Library of Congress Subject Headings
Graph theory; Graph theory--Data processing
Computer Science (MS)
Department, Program, or Center
Computer Science (GCCIS)
Culak, Juraj, "Separators in High-Genus Near-Planar Graphs" (2016). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus