Публикации на Недялко Ненов

1. δ_k-small sets in graphs. (with A. Bojilov), Mathematics and Education. Proc. Forty Second Spring Conf. Union Bulg. Math., Borovets, 2013, 189-197, preprint: arXiv:1211.3689v1 15 Nov 2012.
2. Partitions of graphs into small and large sets. (with A. Bojilov, Y. Caro and A. Hansberg), Discrete Applied Mathematics 161 (2013), 1912-1924, preprint: arXiv:1205.1727v1 [math.CO] 8 May 2012.
3. An Inequality for Generalized Chromatic Graphs. (with A. Bojilov), Mathematics and Education. Proc. Forty First Spring Conf. Union Bulg. Math., Borovets, 2012, 143-147, preprint: arXiv:1111.5598v1 23 Nov 2011.
4. Chromatic number of graphs and edge folkman numbers., C. R. Acad. Bulg. Sci., 63 (2010), № 8, 1103-1110, preprint: arXiv:0903.3812v1 [math.CO] 23 Mar 2009.
5. On the Vertex Folkman Numbers F_v(2,...,2;q)., Serdica Math.J., 35 (2009), 251-272, preprint: arXiv:0903.3812v1 [math.CO] 23 Mar 2009
6. On the Vertex Folkman Number F_v(2,...,2;r-1) and F_v(2,...,2;r-2). Annuaire Univ. Sofia Fac. Math. Inform., submitted in 2007. Preprint: arXiv:0903.3151v [math. CO], 18 Mar 2009.
7. New upper bound for a class of vertex Folkman numbers. (with Kolev, N.), Electron. J. Combin. 13 (2006), #R14.
8. Folkman number F_e(3, 4; 8) is equal to 16. (with Kolev, N.) C. R. Acad. Bulg. Sci. 59 (2006), № 1, 25-30.
9. Improvement of graph theory Wei's inequality. Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets, 2006, 191-194.
10. New recurrent inequality on a class of vertex Folkman numbers. (with Kolev, N.) Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets, 2006, 164-168.
11. Extremal problems of graph colorings. Dr. Sci. Thesis, Sofia Univ., Sofia, 2005.
12. An example of a 16-vertex Folkman (3, 4)-graph without 8-cliques. (with Kolev, N.)Annuaire Univ. Sofia, Fac. Math. Inform. 98 (2008), 127-141.
13. On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number. (with Kolev, N.)Annuaire Univ. Sofia, Fac. Math. Inform. 98 (2008), 101-126.
14. Balanced vertex sets in graphs. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 97 (2005), 81-96.
15. Turan's Theorem and maximal degrees. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 173-174.
16. Sequences of maximal degree vertices in graphs. (with Khadzhiivanov, N.) Serdica Math. J. 30 (2004), 96-102.
17. Saturated β-sequences in graphs. (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 57 (2004), n. 6, 49-54.
18. Lower bounds for some Ramsey numbers. Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 85-87.
19. Generalized Turan's graphs theorem. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 69-73.
20. Generalized r-partite graphs and Turan's Theorem. (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 57 (2004), n. 2, 19-24.