On Ramsey numbers and Kr-coloring of graphs
暂无分享,去创建一个
[1] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.
[2] J. G. Kalbfleisch. Construction of Special Edge-Chromatic Graphs , 1965, Canadian Mathematical Bulletin.
[3] J. G. Kalbfleisch. Upper bounds for some Ramsey numbers , 1967 .
[4] Jack E. Graver,et al. Some graph theoretic results associated with Ramsey's theorem* , 1968 .
[5] R. Graham. On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon , 1968 .
[6] J. Folkman. Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .
[7] Joel Spencer,et al. On small graphs with forced monochromatic triangles , 1971 .