Timeline for Complexity of edge coloring in planar graphs
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30, 2019 at 20:24 | comment | added | draks ... | Hi, do you know if there is any progress for 3-edge colorings on cubic graphs on a double torus? | |
| Jul 22, 2016 at 11:39 | history | tweeted | twitter.com/StackCSTheory/status/756453672968658945 | ||
| S Jul 20, 2016 at 20:29 | history | suggested | draks ... | CC BY-SA 3.0 |
MO post deleted
|
| Jul 20, 2016 at 8:54 | review | Suggested edits | |||
| S Jul 20, 2016 at 20:29 | |||||
| Oct 8, 2014 at 15:10 | vote | accept | Mohammad Al-Turkistany | ||
| Nov 20, 2013 at 21:30 | comment | added | draks ... | +1 great question, I'm have a simliar, but more practical one... | |
| Dec 7, 2012 at 20:54 | answer | added | Diamantis Koreas | timeline score: 5 | |
| Feb 22, 2011 at 19:26 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
cross posted; added 17 characters in body
|
| Nov 29, 2010 at 13:46 | history | bounty ended | CommunityBot | ||
| Nov 22, 2010 at 18:13 | comment | added | Mohammad Al-Turkistany | The table entry refers to Robertson, Sanders, Seymour, and Thomas Four Coloring paper which deals with Bridgeless cubic planar graphs. | |
| Nov 22, 2010 at 17:47 | comment | added | Oleksandr Bondarenko | Doesn't line 2 in table 1 in dx.doi.org/10.1007/s00453-007-9044-3 mean that "3-edge coloring of cubic planar graphs" is polynomially solvable? | |
| Nov 22, 2010 at 13:14 | history | bounty started | Mohammad Al-Turkistany | ||
| Oct 31, 2010 at 15:31 | answer | added | Joseph Malkevitch | timeline score: 4 | |
| Oct 31, 2010 at 13:50 | history | edited | Jukka Suomela |
tags
|
|
| Oct 31, 2010 at 12:20 | answer | added | Emil | timeline score: 17 | |
| Oct 31, 2010 at 8:48 | history | asked | Mohammad Al-Turkistany | CC BY-SA 2.5 |