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
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2021 at 4:37 | history | edited | Tony Huynh |
edited tags
|
|
| Feb 17, 2016 at 17:11 | vote | accept | user31016 | ||
| Feb 17, 2016 at 9:57 | answer | added | Tony Huynh | timeline score: 11 | |
| Feb 17, 2016 at 9:12 | history | edited | user31016 |
edited tags
|
|
| Feb 17, 2016 at 6:16 | history | asked | user31016 | CC BY-SA 3.0 |