Timeline for Node-edge coloring of graphs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2015 at 11:53 | comment | added | Gordon Royle | For the complete graph $K_n$, the total chromatic number is $n$ or $n+1$ for odd and even $n$ respectively. | |
| Nov 14, 2015 at 16:16 | comment | added | Gerhard Paseman | Is this number known for $K_n$ ( complete graph )? Gerhard "Feeling Somewhat Colorful This Day" Paseman, 2015.11.14 | |
| Nov 14, 2015 at 13:37 | vote | accept | Joseph O'Rourke | ||
| Nov 14, 2015 at 11:33 | comment | added | Gordon Royle | Actually it has received some interest. The total coloring conjecture is that the total chromatic number is at most $\Delta + 2$ (maximum degree plus 2). This was conjectured by the Iranian mathematician Mehdi Behzad in the 1960s, but also appeared in the work of Vizing (note the similarity to Vizing's edge chromatic number theorem), and who has priority is in some dispute. | |
| Nov 14, 2015 at 7:22 | history | answered | Stella Biderman | CC BY-SA 3.0 |