Timeline for Do planar graphs have an acyclic two-coloring?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2020 at 13:03 | answer | added | Tony Huynh | timeline score: 1 | |
| Nov 23, 2016 at 13:20 | vote | accept | domotorp | ||
| Nov 23, 2016 at 13:13 | answer | added | monkeymaths | timeline score: 10 | |
| Nov 23, 2016 at 13:06 | comment | added | Pat Devlin | The edges of any planar graph can be decomposed into $3$ forests, and this is tight ( en.m.wikipedia.org/wiki/Arboricity ), but you aren't decomposing all the edges, and your forests are induced subgraphs. Hmm... | |
| Nov 23, 2016 at 12:26 | history | asked | domotorp | CC BY-SA 3.0 |