@fidelbc : I didn't know that condition about m = 3n - 6 ... but now I found it (from Euler formula) for example
https://en.wikipedia.org/wiki/F%C3%A1ry%27s_theorem For drawing a planar and not maximal planar graph, a "straight" edge drawing would satisfy me.... In some papers (for example : https://cs.brown.edu/~rt/gdhandbook/chapters/straightline.pdf , end of 6.4) you can read that one algorithm is simply to add edges making graph maximal planar, drawing it (for example with planar layout) and removing edges. It's simple improvment of actual code in sagemath...but of course, adding edges will sometimes produce a layout you will not expect...and that's why, I would like an optional ordered list of "authorized" edges to add as argument of planar layout call The list of "authorized" edges could be the minimum of edges making the layout unique or 3-connected or convex planar or list of edges ordered by shortest length path or making the graph with Fary embedding or ... 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.
