Timeline for Is there a polynomial-time algorithm to check if a signed graph contains an odd-K5 minor?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2016 at 17:43 | comment | added | user31016 | @TonyHuynh, many thanks for your help! Do you know if there's some kind of generalization of Guenin's result (characterizing weakly bipartite signed graphs) to the more general setting you've looked at, with $\Gamma$-labeled graphs? | |
| Feb 17, 2016 at 17:11 | vote | accept | user31016 | ||
| Feb 17, 2016 at 13:03 | comment | added | Tony Huynh | @mathlove Thanks for spotting that typo. It has been edited. | |
| Feb 17, 2016 at 12:24 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
fix spelling
|
| Feb 17, 2016 at 12:16 | comment | added | mathlove | It is "Kawarabayashi", not "Kawawarabayashi". | |
| Feb 17, 2016 at 10:05 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 66 characters in body
|
| Feb 17, 2016 at 9:57 | history | answered | Tony Huynh | CC BY-SA 3.0 |