Timeline for How can you construct 3-regular graphs with minimal diameter?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2016 at 21:12 | history | tweeted | twitter.com/StackCompSci/status/815304655794241536 | ||
| Dec 31, 2016 at 17:57 | history | edited | Ariel | CC BY-SA 3.0 |
deleted 24 characters in body; edited title
|
| Dec 31, 2016 at 17:53 | answer | added | Ariel | timeline score: 1 | |
| Dec 31, 2016 at 17:50 | comment | added | MaiaVictor | Yes, I guess that is the name. | |
| Dec 31, 2016 at 17:49 | history | edited | MaiaVictor | CC BY-SA 3.0 |
deleted 4 characters in body; edited title
|
| Dec 31, 2016 at 16:49 | comment | added | Ariel | Having $\frac{3}{2}|V|$ edges is not equivalent to being 3-regular, are you focusing only on 3-regular graphs? | |
| Dec 31, 2016 at 16:13 | history | asked | MaiaVictor | CC BY-SA 3.0 |