Geodesic
Colour Classes for r-Graphs
Canadian mathematical bulletin, Tome 15 (1972) no. 3, pp. 349-354

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

By an r-graph G we mean a finite set V(G) of elements called vertices and a set E(G) of some of the r-subsets of V(G) called edges. This paper defines certain colour classes of r-graphs which connect the material of a variety of recent graph theoretic literature in that many existing results may be reformulated as structural properties of the classes for some special cases of r-graphs. It is shown that the concepts of Ramsey Numbers, chromatic number and index may be defined in terms of these classes. These concepts and some of their properties are generalized. The final subsection compares two existing bounds for the chromatic number of a graph. 
Cockayne, E. J. Colour Classes for r-Graphs. Canadian mathematical bulletin, Tome 15 (1972) no. 3, pp. 349-354. doi: 10.4153/CMB-1972-063-2
@article{10_4153_CMB_1972_063_2,
     author = {Cockayne, E. J.},
     title = {Colour {Classes} for {r-Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {349--354},
     year = {1972},
     volume = {15},
     number = {3},
     doi = {10.4153/CMB-1972-063-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-063-2/}
}
TY  - JOUR
AU  - Cockayne, E. J.
TI  - Colour Classes for r-Graphs
JO  - Canadian mathematical bulletin
PY  - 1972
SP  - 349
EP  - 354
VL  - 15
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-063-2/
DO  - 10.4153/CMB-1972-063-2
ID  - 10_4153_CMB_1972_063_2
ER  - 
%0 Journal Article
%A Cockayne, E. J.
%T Colour Classes for r-Graphs
%J Canadian mathematical bulletin
%D 1972
%P 349-354
%V 15
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-063-2/
%R 10.4153/CMB-1972-063-2
%F 10_4153_CMB_1972_063_2

[1] 1. Ryser, H. J., Combinatorial mathematics, Carus Math. Monograph, Math. Assoc. America, 14 (1965), 38-43. Google Scholar

[2] 2. Ramsey, F. P., On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264-286. Google Scholar

[3] 3. Cockayne, E. J., An application of Ramsey's theorem, Canad. Math. Bull. (1) 13 (1970), 145-6. Google Scholar

[4] 4. Greenwood, R. E. and Gleason, A. M., Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7. Google Scholar

[5] 5. Chartrand, G., Geller, D. and Hedetniemi, S., A generalization of the chromatic number, Proc. Cambridge Philos. Soc. 64 (1968), 265-271. Google Scholar

[6] 6. Hedetniemi, S., Disconnected colourings of graphs, Combinatorial Structures and their applications. Gordon & Breach, New York (1970), 163-168. Google Scholar

[7] 7. G. Szekeres and Wilf, H. S., An inequality for the chromatic number of a graph, J. Comb. Theory (1) 4 (1968), 1-3. Google Scholar

[8] 8. Harary, F., Graph theory, Addison-Wesley, Reading, Mass., 1969. Google Scholar

Cité par Sources :