I am working with NetworkX Graphs in Python and I would like to find the Kuratowski subgraphs of any given graph which I have.
The Boyer-Myrvold planar graph testing algorithm can return an existing Kuratowski subgraph if the graph is not planar (O(n) in the number of vertices n), so I was hoping that there might already be an implementation of that algorithm or of a similar algorithm in Python. I have been so far unable to find one and I am slightly reluctant at having to re-implement it from the original research paper.
It is even better if it can easily interface with NetworkX library for graphs.