Timeline for chromatic number of a simple graph whose length of the longest odd cycle is 2k+1
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2013 at 2:08 | comment | added | user40096 | Thank you very much!!!The informations you provided are very helpful! | |
| Sep 24, 2013 at 1:21 | comment | added | Yuichiro Fujiwara | @user40096 I edited the answer so it covers the even cycle case too. | |
| Sep 23, 2013 at 15:17 | history | edited | Yuichiro Fujiwara | CC BY-SA 3.0 |
added 833 characters in body
|
| Sep 23, 2013 at 14:01 | vote | accept | user40096 | ||
| Sep 23, 2013 at 14:00 | vote | accept | user40096 | ||
| Sep 23, 2013 at 14:01 | |||||
| Sep 23, 2013 at 13:58 | comment | added | user40096 | Thank you very much!It is very helpful!The paper by A. Gyárfás is very powerful!I want to ask if the "odd cycle" is changed by"even cycle",is it also right? | |
| Sep 23, 2013 at 13:54 | vote | accept | user40096 | ||
| Sep 23, 2013 at 14:00 | |||||
| Sep 23, 2013 at 13:54 | vote | accept | user40096 | ||
| Sep 23, 2013 at 13:54 | |||||
| Sep 23, 2013 at 13:53 | vote | accept | user40096 | ||
| Sep 23, 2013 at 13:54 | |||||
| Sep 22, 2013 at 16:13 | history | answered | Yuichiro Fujiwara | CC BY-SA 3.0 |