I suspect this exists, if anyone has a reference please that would be very helpful.
By signed graph, I mean each edge is designated either odd or even (e.g. as in Guenin's result for weakly bipartite graphs).
Is there a polynomial-time algorithm to check if a signed graph contains an odd-K5 minor?
user31016
- 311
- 1
- 7