Geodesic
On Infinite Full Colourings of Graphs
Canadian journal of mathematics, Tome 30 (1978) no. 3, pp. 455-457

Voir la notice de l'article provenant de la source Cambridge University Press

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). 
Fawcett, Barry. On Infinite Full Colourings of Graphs. Canadian journal of mathematics, Tome 30 (1978) no. 3, pp. 455-457. doi: 10.4153/CJM-1978-039-8
@article{10_4153_CJM_1978_039_8,
     author = {Fawcett, Barry},
     title = {On {Infinite} {Full} {Colourings} of {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {455--457},
     year = {1978},
     volume = {30},
     number = {3},
     doi = {10.4153/CJM-1978-039-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1978-039-8/}
}
TY  - JOUR
AU  - Fawcett, Barry
TI  - On Infinite Full Colourings of Graphs
JO  - Canadian journal of mathematics
PY  - 1978
SP  - 455
EP  - 457
VL  - 30
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1978-039-8/
DO  - 10.4153/CJM-1978-039-8
ID  - 10_4153_CJM_1978_039_8
ER  - 
%0 Journal Article
%A Fawcett, Barry
%T On Infinite Full Colourings of Graphs
%J Canadian journal of mathematics
%D 1978
%P 455-457
%V 30
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1978-039-8/
%R 10.4153/CJM-1978-039-8
%F 10_4153_CJM_1978_039_8

[1] 1. Harary, F., Graph theory (Don Mills, London, New York, 1969). Google Scholar

[2] 2. Unsolved problems in groups and graphs, Simon Fraser Seminar in Groups and Graphs: Proceedings, page 4 (Burnaby, B.C. 1974). Google Scholar

Cité par Sources :