Name
Abstract | ||
|---|---|---|
With the help of computer algorithms, we improve the lower bound on the edge Folkman number Fe(3, 3; 5) and vertex Folkman number Fv(3, 3; 4), and, thus, show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 41–49, 1999 |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1002/(SICI)1097-0118(199909)32:1<>1.0.CO;2-V | Journal of Graph Theory |
Keywords | DocType | Volume |
computer algorithm,edge Folkman number Fe,present computer enumeration,vertex Folkman number,Inc. J Graph Theory,John Wiley,critical graph,exact value | Journal | 32 |
Issue | ISSN | Citations |
1 | 0364-9024 | 4 |
PageRank | References | Authors |
0.77 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konrad Piwakowski | 1 | 18 | 4.43 |
| Stanislaw P. Radziszowski | 2 | 108 | 23.90 |
| Sebastian Urbanski | 3 | 14 | 2.54 |