Publication:3338272
From MaRDI portal
zbMath0547.05030MaRDI QIDQ3338272
Publication date: 1984
Related Items
Unnamed Item, Partitioning graphs into complete and empty graphs, The size of a minimum five-chromatic \(K_ 4\)-free graph, On the triangle vertex Folkman numbers, On the small graphs with chromatic number 5 without 4-cliques, On some edge Folkman numbers, small and large, On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$