Timeline for Which is the most time efficient algorithm for having a Tait Coloring (edge-3-coloring) of planar cubic graphs?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Oct 23, 2016 at 18:46 | history | bounty ended | Mario Stefanutti | ||
| Oct 20, 2016 at 20:29 | vote | accept | Mario Stefanutti | ||
| Oct 17, 2016 at 9:23 | comment | added | Gordon Royle | One step of this is locating one of the 600+ unavoidable configurations in the planar graph, which sounds like something difficult to implement. | |
| Oct 16, 2016 at 21:02 | history | answered | Adam P. Goucher | CC BY-SA 3.0 |