Timeline for Can the Vertices of cubic graph be partitioned into and induced cycle and a forest?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2013 at 17:04 | history | edited | Wolfgang | CC BY-SA 3.0 |
added counterexample for a 4-connected graph
|
| Dec 15, 2013 at 11:01 | comment | added | joro | I think the Meredith graph is 4-regular 4-connected non-hamiltonian. | |
| Dec 15, 2013 at 9:28 | history | edited | Wolfgang | CC BY-SA 3.0 |
minor
|
| Dec 15, 2013 at 7:45 | history | answered | Wolfgang | CC BY-SA 3.0 |