Return to Revisions

2 of 3

edited tags

edited Feb 17, 2016 at 9:12

311
1
7

Is there a polynomial-time algorithm to check if a signed graph contains an odd-K5 minor?

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).

reference-request graph-theory graph-minors

asked Feb 17, 2016 at 6:16

311
1
7