a. Shortest non-separating cycles
b. Menger's theorem
c. Planarizing with at most g cycles via cycles: O(sqrt{gn} log g)
d. Greedy tree-cotree again again
e. Planarixing via level slicing and greedy loops: O(sqrt{gn})