Timeline for Do you know a faster algorithm to color planar graphs?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2022 at 16:37 | answer | added | HermannSW | timeline score: 2 | |
| Jan 2, 2019 at 5:53 | answer | added | prusswan | timeline score: 1 | |
| Oct 19, 2016 at 21:20 | vote | accept | Mario Stefanutti | ||
| Oct 19, 2016 at 1:12 | answer | added | Timothy Chow | timeline score: 6 | |
| Oct 19, 2016 at 0:51 | comment | added | Mario Stefanutti | Edge coloring using 3 colors, known as Tait coloring. It is equivalent to the four cilor theorem for the faces | |
| Oct 18, 2016 at 22:26 | comment | added | Gerry Myerson | You don't explicitly say so, but I assume by "coloring" you mean "4-coloring". | |
| Oct 18, 2016 at 21:23 | history | asked | Mario Stefanutti | CC BY-SA 3.0 |