It is simpler to check if a graph is maximal planar. If you already know the graph is planar, then just check if it has 3n-6 edges. If it does, then it is maximal, otherwise it isn't.
What planar layout do you suggest for graphs that are not maximal planar? f On Monday, October 19, 2015 at 12:04:33 PM UTC-4, Dominique Laurain wrote: > > > "Change the doc" > > yes, I am suggesting that for the planar layout; if the input graph is not > maximal planar > > and you can add a simple function checking that one graph is maximal > planar (simple to code : loop on each couple of vertices, and add edge made > of this couple, if adding make graph not planar then break in the loop. > return not maximal ...end of loop, return maximal) > > Dominique > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
