Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-12-03T20:47:14.157Z Has data issue: false hasContentIssue false
  • English
  • Français

On Infinite Full Colourings of Graphs

Published online by Cambridge University Press:  20 November 2018

Barry Fawcett
Barry Fawcett*
Affiliation:
University of Windsor, Windsor, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Canadian Journal of Mathematics , Volume 30 , Issue 3 , 01 June 1978 , pp. 455 - 457
Copyright
Copyright © Canadian Mathematical Society 1978

References

1. Harary, F., Graph theory (Don Mills, London, New York, 1969).Google Scholar
2. Unsolved problems in groups and graphs, Simon Fraser Seminar in Groups and Graphs: Proceedings, page 4 (Burnaby, B.C. 1974).Google Scholar