Please note, due to essential maintenance online purchasing will be unavailable between 08:00 and 12:00 (BST) on 24th February 2019. We apologise for any inconvenience.
This paper answers affirmatively a question of Pavol Hell : if a graph admits a full n-colouring for every finite n ≧ n0, does it admit an infinité full colouring? (A colouring is full if every pair of distinct colour classes is joined by at least one edge).
Email your librarian or administrator to recommend adding this journal to your organisation's collection.