A graph is said to be k-chromatic if its vertices can be split into k classes so that two vertices of the same class are not connected (by an edge) and such a splitting is not possible for k−1 classes. Tutte was the first to show that for every k there is a k-chromatic graph which contains no triangle .
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.