Timeline for On cycles in self-centered graphs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2013 at 7:26 | comment | added | Sergiy Kozerenko | But we need $\leq 2m+1$! | |
| Sep 14, 2013 at 18:46 | comment | added | Harry Altman | Certainly if you choose $C$ to be as short as possible, it has length at most $3m+1$, since otherwise the center vertices on the return path would be too far away from $a$ and $b$. | |
| Sep 14, 2013 at 12:49 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 879 characters in body
|
| Sep 13, 2013 at 16:41 | comment | added | Sergiy Kozerenko | Thanks! My original question is obviously stupid. But what one could say if we replace "$C_{2m}$" by "$C_{2m}$ or $C_{2m+1}$"? | |
| Sep 13, 2013 at 15:07 | history | answered | Tony Huynh | CC BY-SA 3.0 |