No CrossRef data available.
Article contents
On Infinite Full Colourings of Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
This paper answers affirmatively a question of Pavol Hell [2]: 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).
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1978