Geodesic
On the Colourings of Graphs
Canadian mathematical bulletin, Tome 4 (1961) no. 2, pp. 157-160

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

DOI

A graph G is defined by a set V(G) of vertices, a set E(G) of edges, and a relation of incidence which associates with each edge two distinct vertices called its ends. We consider only the case in which V(G) and E(G) are both finite.An n-colouring of G is usually defined as a mapping f of V(G) into the set of integers { 1, 2,..., n} which maps the two ends of any edge onto distinct integers. The integers 1 to n are the n "colours". Much work has been done on n-colourings in recent years, especially by G. A. Dirac. 
Tutte, W.T. On the Colourings of Graphs. Canadian mathematical bulletin, Tome 4 (1961) no. 2, pp. 157-160. doi: 10.4153/CMB-1961-019-4
@article{10_4153_CMB_1961_019_4,
     author = {Tutte, W.T.},
     title = {On the {Colourings} of {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {157--160},
     year = {1961},
     volume = {4},
     number = {2},
     doi = {10.4153/CMB-1961-019-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-019-4/}
}
TY  - JOUR
AU  - Tutte, W.T.
TI  - On the Colourings of Graphs
JO  - Canadian mathematical bulletin
PY  - 1961
SP  - 157
EP  - 160
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-019-4/
DO  - 10.4153/CMB-1961-019-4
ID  - 10_4153_CMB_1961_019_4
ER  - 
%0 Journal Article
%A Tutte, W.T.
%T On the Colourings of Graphs
%J Canadian mathematical bulletin
%D 1961
%P 157-160
%V 4
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-019-4/
%R 10.4153/CMB-1961-019-4
%F 10_4153_CMB_1961_019_4

Cité par Sources :