Question: How to flatten a graph?

Let G be a connected undirected graph. How to find the minimal set of the edges of G, such that its annihilation transforms G to a planar graph, with Maple? The procedure should work with big graphs.

Please Wait...