Timeline for Reconstructing a graph from the multiset of degrees
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2016 at 19:28 | vote | accept | Dominic van der Zypen | ||
| Jan 9, 2016 at 18:04 | comment | added | Tony Huynh | Of course not. Otherwise, all $k$-regular graphs with the same number of vertices would be isomorphic. $K_{3,3}$ and the triangular prism is a concrete counterexample. | |
| Jan 9, 2016 at 17:23 | answer | added | GMB | timeline score: 4 | |
| Jan 9, 2016 at 17:21 | answer | added | JWL | timeline score: 3 | |
| Jan 9, 2016 at 17:15 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |