Author:
Dudek Andrzej,Rödl Vojtěch
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Brown, J.I., Rödl, V.: A Ramsey type problem concerning vertex colourings. J. Comb. Theory, Ser. B 52(1), 45–52 (1991)
2. Coles, J., Radziszowski, S.: Computing the Folkman number F v (2,2,3;4). J. Combinatorial Mathematics and Combinatorial Computing 58, 13–22 (2006)
3. Eaton, N., Rödl, V.: A canonical Ramsey theorem. Random Structures and Algorithms 3(4), 427–444 (1992)
4. Folkman, J.: Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Appl. Math. 18, 19–24 (1970)
5. Royle, G., Godsil, C.: Algebraic graph theory. Springer, New York (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献