Licheng Zhang

Thanks for your kind help. I feel like I'm going to be a big fan of this project.

I have the same problem. (windows) 

From the discussion below, it appears that there is no polynomial algorithm for finding all minimal cuts. I feel that I have misread Literature [1], or the result of Literature...

OK. I have put the information in there. Best wishes!

Nice. By the way, will the new version of IGraphM be released this year?

I've noticed that when I move (or just click) the four vertices (or any one of them) on the external face, and then press Shift-Enter, the embedding of the graph...

@Wali-Muhammad123 Thank you very much for your attention to this question. I keep an interest in this question.

@Wali-Muhammad123 The input for the program is a graph $G$. If it can be decomposed, output True, and optionally return two smaller graphs such that their product is graph $G$,...