On Ramsey numbers and Kr-coloring of graphs
Author:
- Shen LinSLShen Lin
- 1 February 1972
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 12 (1) , 82-92
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagonJournal of Combinatorial Theory, 1968
- Some graph theoretic results associated with Ramsey's theoremJournal of Combinatorial Theory, 1968
- Upper bounds for some Ramsey numbersJournal of Combinatorial Theory, 1967
- Construction of Special Edge-Chromatic GraphsCanadian Mathematical Bulletin, 1965
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955