On Infinite Full Colourings of Graphs

@article{Fawcett1978OnIF,
  title={On Infinite Full Colourings of Graphs},
  author={Barry Fawcett},
  journal={Canadian Journal of Mathematics},
  year={1978},
  volume={30},
  pages={455 - 457}
}
  • Barry Fawcett
  • Published 1 June 1978
  • Mathematics
  • Canadian Journal of Mathematics
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). 
View on Cambridge Press
web.archive.org
1 Citations

One Citation

A Complete Bibliography of Publications in Canadian Journal of Mathematics = Journal canadien de mathématiques for the decade 1940–1949

33]. algebraic [5]. Angular [24]. Applications [30]. arbitrary [8]. associated [18]. Axiomatic [31]. between [27]. bounded [11, 14]. Boundedness [16]. Cayleyan [4]. certain [9]. characteristic [35].…

References

SHOWING 1-2 OF 2 REFERENCES

Unsolved problems in groups and graphs

  • Simon Fraser Seminar in Groups and Graphs: Proceedings
  • 1974

Graph theory (Don

  • 1969