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
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/}
}
Cité par Sources :