Timeline for Total chromatic number and total clique number
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2016 at 12:08 | vote | accept | Dominic van der Zypen | ||
| May 26, 2016 at 9:49 | answer | added | Fedor Petrov | timeline score: 3 | |
| May 26, 2016 at 9:41 | comment | added | Ben Barber | The total colouring conjecture is that $\chi(T(G)) \leq \Delta(G) + 2$. If there is an example showing that this many colours are needed then your first observation would mean that the answer is yes. | |
| May 26, 2016 at 7:34 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 1 character in body
|
| May 26, 2016 at 7:11 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |