Timeline for Cycles of length 1(mod 3) in regular graphs
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2010 at 3:12 | vote | accept | Gjergji Zaimi | ||
| Jul 26, 2010 at 17:48 | answer | added | Jukka Suomela | timeline score: 7 | |
| Jul 22, 2010 at 13:46 | comment | added | Gjergji Zaimi | Yes, the cycles are simple, too. | |
| Jul 22, 2010 at 13:39 | comment | added | Grigory Yaroslavtsev | Do you mean simple cycle? | |
| Jul 22, 2010 at 13:30 | comment | added | Gjergji Zaimi | Yes thanks for the correction, simple and connected. | |
| Jul 22, 2010 at 13:13 | answer | added | Joseph Malkevitch | timeline score: 1 | |
| Jul 22, 2010 at 12:58 | comment | added | Tony Huynh | I guess you want the graph to be simple. Take two vertices connected by 4 edges. | |
| Jul 22, 2010 at 5:03 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
edited title
|
| Jul 22, 2010 at 4:12 | history | asked | Gjergji Zaimi | CC BY-SA 2.5 |