A separator theorem for graphs of bounded genus

Goal: Explain lemma 2.2

Algorithm

input: A graph embedded in an orientable surface S of genus g

output: A set of separators which bisects the original graph

deck

By austinlaurice

deck

726

austinlaurice