Colour Classes for r-Graphs
- 1 September 1972
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 15 (3) , 349-354
- https://doi.org/10.4153/cmb-1972-063-2
Abstract
By anr-graph G we mean a finite setV(G) of elements called vertices and a setE(G) of some of ther-subsets ofV(G) called edges. This paper defines certain colour classes ofr-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 ofr-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.Keywords
This publication has 7 references indexed in Scilit:
- An Application of Ramsey's TheoremCanadian Mathematical Bulletin, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A generalization of the chromatic numberMathematical Proceedings of the Cambridge Philosophical Society, 1968
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- A theorem of RamseyPublished by American Mathematical Society (AMS) ,1963
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930