Timeline for Is the set of edge of a cubic graph the union of a cycle and and an Acyclic graph?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2013 at 18:15 | vote | accept | hbm | ||
| Dec 15, 2013 at 7:27 | answer | added | bof | timeline score: 2 | |
| Dec 14, 2013 at 17:37 | history | edited | hbm | CC BY-SA 3.0 |
added 4 characters in body
|
| Dec 14, 2013 at 17:29 | history | edited | hbm | CC BY-SA 3.0 |
added 144 characters in body
|
| Dec 14, 2013 at 5:19 | comment | added | hbm | Not quite. One deals with partitioning the edge set and the other with the vertex set. For example, in the edge case the cycle could have chord, however, in the vertex case the cycle cannot have a chord. | |
| Dec 14, 2013 at 3:42 | comment | added | Gerry Myerson | Isn't this identical to the other question you just asked? mathoverflow.net/questions/151802/… | |
| Dec 13, 2013 at 23:15 | history | edited | hbm | CC BY-SA 3.0 |
edited title
|
| Dec 13, 2013 at 23:10 | history | asked | hbm | CC BY-SA 3.0 |