| Дисертация доктор на науките |
|
|
N. Nenov, Extremal problems of graph colorings, СУ "св. Климент Охридски", ФМИ
|
2005
|
| Дисертация д-р |
|
|
N. Nenov, Ramsey graphs and some constants related to them. (in Bulgarian), СУ "Климент Охридски"
|
1980
|
| Друго (научно-популярни и др. под.) |
|
1
|
Н. Нenoв, Н. Хаджииванов, Математика Плюс, № 2, 2004, 46-52,
|
2004
|
|
2
|
Н. Нenoв, Н. Хаджииванов, Математика, 1999, № 4, 12,
|
1999
|
|
3
|
Н. Нenoв, Математика, 1999, № 3, 14,
|
1999
|
|
4
|
Н. Нenoв, Н. Хаджииванов, Математика, 1999, № 2, 14,
|
1999
|
|
5
|
Недялко Димов Нeнов, Математика Плюс, 1997, № 1, 40.,
|
1997
|
|
6
|
Недялко Димов Нeнов, Математика, 1997, № 3, 3.,
|
1997
|
|
7
|
Недялко Димов Нeнов, Математика, 1997, № 4, 14-19.,
|
1997
|
|
8
|
Недялко Димов Нeнов, Математика, 1996, № 2, 7-8,
|
1996
|
|
9
|
Недялко Димов Нeнов, Математика, 1996, № 6, 3-8.,
|
1996
|
|
10
|
Недялко Димов Нeнов, К. Чакърян, Елементарна Математика, 1992, № 1, 6-11,
|
1992
|
|
11
|
Недялко Димов Нeнов, К. Чакърян, Елементарна Математика, 1991, № 1, 14-18 ,
|
1991
|
|
12
|
Недялко Димов Нeнов, К.Чакърян, Математика, 1991, № 10, 9-13,
|
1991
|
|
13
|
Недялко Димов Нeнов, К. Чакърян, Математика, 1991, № 2, 6-11 ,
|
1991
|
|
14
|
Недялко Димов Нeнов, К. Чакърян, Обучението по математика, 1991, № 2, 25-30,
|
1991
|
|
15
|
Недялко Димов Нeнов, П. Сидеров, Обучението по математика, 1989, № 2, 45-48,
|
1989
|
|
16
|
Недялко Димов Нeнов, Обучението по математика, 1988, № 1, 54-57.,
|
1988
|
|
17
|
Недялко Димов Нeнов, Обучението по математика, 1987, № 1, 54-58.,
|
1987
|
|
18
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1986, № 2, 12-17,
|
1986
|
|
19
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1985, № 4, 31-35,
|
1985
|
|
20
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1982, № 8, 6-11,
|
1982
|
|
21
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1981, № 3, 11-15,
|
1981
|
|
22
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1980, № 2, 6-10,
|
1980
|
|
23
|
Недялко Димов Нeнов, Н. Хаджииванов, Вл. Тодоров, Задочна школа по математика, София 1978,
|
1978
|
|
24
|
Недялко Димов Нeнов, Н. Хаджииванов, Задочна школа по математика, София 1977,
|
1977
|
|
25
|
Недялко Димов Нeнов, Н. Хаджииванов, Вл. Тодоров, Задочна школа по математика, София 1977,
|
1977
|
|
26
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1976, № 3, 7-10,
|
1976
|
|
27
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, № 5, 16-17 ,
|
1976
|
|
28
|
Недялко Димов Нeнов, Обучението по математика, 1976, № 6, 7-10.,
|
1976
|
|
29
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1976, № 1, 7-10 ,
|
1976
|
|
30
|
Недялко Димов Нeнов, Н. Хаджииванов, Математика, 1976, № 4, 28-31, ,
|
1976
|
| Научен проект |
|
1
|
Недялко Нeнов, Дискретни алгебрични и цомбинаторни структури, Ръководител, Фонд НИ на СУ, Номер на договора:027/2012
|
2012
|
|
2
|
Недялко Нeнов, Дискретни алгебрични и комбинаторни структури, Ръководител, Фонд НИ на СУ, Номер на договора:187/2011
|
2011
|
|
3
|
Недялко Нeнов, Дискретни алгебрични и комбинаторни структури, Ръководител, Фонд НИ на СУ, Номер на договора:226/2010
|
2010
|
|
4
|
Недялко Нeнов, Algebri`ni, topologi`ni i kombinatorni strukturi, Ръководител, Фонд НИ наСУ, Номер на договора:75/2009
|
2009
|
|
5
|
Недялко Нeнов, Алгебрична структура и Теория на графите, Ръководител, Фонд НИ на СУ, Номер на договора:90/2008
|
2008
|
|
6
|
Недялко Нeнов, Алгебрични структури и Теория на Графите, Ръководител, Фонд НИ на СУ, Номер на договора:55/2007 г
|
2007
|
|
7
|
Недялко Нeнов, Алгебрични структури и Теория на графите, Ръководител, Фонд НИ на СУ, Номер на договора:85/2006 г
|
2006
|
| Научно ръководство |
|
1
|
Недялко Нeнов, Кампютърноизследване на малки грапшхи на Ремзи, ФМИ дипломна работа:Александър Биков
|
2013
|
|
2
|
Недялко Нeнов, Числа на Фолкман, ФМИ дисертация д-р:Николай Колев
|
2006
|
| Статия в научно списание |
|
1
|
A. Bikov, N. Nenov, On the vertex Folkman numbers F_v(a_1, ..., a_s; m - 1) when max{a_1, ..., a_s} = 6 or 7, Journal of Combinatorial Mathematics and Combinatorial Computing, preprint arxiv:1512.02051, vol:109, 2019, pages:213-243, ISSN (print):0835-3026, Ref SJR (0.272 - 2019), PhD
|
2019
|
|
2
|
A. Bikov, N. Nenov, Lower bounding the Folkman numbers F_v(a_1, ..., a_s; m-1), Annuaire de l'Universite de Sofia “St. Kliment Ohridski”, preprint arxiv:1711.01535, vol:104, 2017, pages:39-53
|
2017
|
|
3
|
A. Bikov, N. Nenov, The edge Folkman number F_e(3, 3; 4) is greater than 19, GEOMBINATORICS, preprint arxiv:1609.03468, vol:27, issue:1, 2017, pages:5-14
|
2017
|
|
4
|
A. Bikov, N. Nenov, The Vertex Folkman numbers F_v(a_1, ..., a_s; m - 1) = m + 9, if max{a_1, ..., a_s} = 5, Journal of Combinatorial Mathematics and Combinatorial Computing, preprint arXiv:1503.08444, vol:103, 2017, pages:171-198, ISSN (print):0835-3026, Ref SJR (0.272 - 2017), PhD
|
2017
|
|
5
|
A. Bikov, N. Nenov, Modified vertex Folkman numbers, Mathematics and Education in Mathematics. Proceedings of the Forty Fifth Spring Conference of the Union of Bulgarian Mathematicians, Pleven, Bulgaria, preprint arXiv:1511.02125, 2016, pages:113-123
|
2016
|
|
6
|
A. Bojilov, N. Nenov, Y. Caro, A. Hansberg, Partitions of graphs into small and large sets, Discrete Applied Mathematics , vol:161, 2013, pages:1912-1924, ISSN (print):0166-218X, doi:http://dx.doi.org/10.1016/j.dam.2013.02.038, Ref, IF, IF (0.677 - 2013), SCOPUS Quartile: Q3 (2013), International
|
2013
|
|
7
|
N. Nenov, Chromatic number of graphs and adge Folkman umbers, C. R. Acad. Bulg. Sci., vol:63, 2010, pages:1103-1110, Web of Science
|
2010
|
|
8
|
N. Nenov, On the Vertex Folkman Number Fv(2,...,2;q), Serdica Math.J, vol:35, 2009, pages:251-272
|
2009
|
|
9
|
N. Nenov, N. Kolev, An example of a 16-vertex Folkman (3, 4)-graph without 8-cliques, Annuaire Univ. Sofia, Fac. Math. Inform., vol:98, 2008, pages:127-141, Ref, PhD
|
2008
|
|
10
|
N. Nenov, N. Kolev, On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number., Annuaire Univ. Sofia, Fac. Math. Inform., vol:98, 2008, pages:101-126, Ref, PhD
|
2008
|
|
11
|
N. Nenov, On the Vertex Folkman Number Fv(2,...,2;r-1) and Fv(2,...,2;r-2)., Annuaire Univ. Sofia Fac. Math. Inform., 2007
|
2007
|
|
12
|
N. Nenov, N. Kolev, Folkman number Fe(3, 4; 8) is equal to 16, C. R. Acad. Bulg. Sci., vol:59, issue:1, 2006, pages:25-30, PhD
|
2006
|
|
13
|
N. Nenov, N. Kolev, New upper bound for a class of vertex Folkman numbers., Electron. J. Combin. , vol:13, 2006, Web of Science, PhD
|
2006
|
|
14
|
N. Nenov, N. Khadzhiivanov, Balanced vertex sets in graphs., Annuaire Univ. Sofia Fac. Math. Inform., vol:97, 2005, pages:50-64, Ref
|
2005
|
|
15
|
N. Nenov, N. Khadzhiivanov, Generalized r-partite graphs and Turan's Theorem., C. R. Acad. Bulg. Sci., vol:57, issue:2, 2004, pages:19-24, Web of Science
|
2004
|
|
16
|
N. Nenov, N. Khadzhiivanov, Generalized Turan's graphs theorem, Annuaire Univ. Sofia Fac. Math. Inform., vol:96, 2004, pages:69-73, Ref
|
2004
|
|
17
|
N. Nenov, Lower bounds for some Ramsey numbers., Annuaire Univ. Sofia Fac. Math. Inform., vol:96, 2004, pages:85-87, Ref
|
2004
|
|
18
|
N. Nenov, N. Khadzhiivanov, Saturated β-sequences in graphs, C. R. Acad. Bulg. Sci. , vol:57, issue:6, 2004, pages:49-54, Web of Science
|
2004
|
|
19
|
N. Nenov, N. Khadzhiivanov, Sequences of maximal degree vertices in graphs, Serdica Math. J., vol:30, 2004, pages:96-102, Ref
|
2004
|
|
20
|
N. Nenov, N. Khadzhiivanov, Turan's Theorem and maximal degrees., Annuaire Univ. Sofia Fac. Math. Inform. , vol:96, 2004, pages:173-174, Ref
|
2004
|
|
21
|
N. Nenov, On the triangle vertex Folkman numbers., Discrete mathematics, vol:271, 2003, pages:327-334, Web of Science
|
2003
|
|
22
|
N. Nenov, E. Nedialkov, Computation of the vertex Folkman numbers F(2, 2, 2, 4; 6) and F(2, 3, 4; 6)., Electron. J. Combin., vol:9, 2002, Web of Science, PhD
|
2002
|
|
23
|
N. Nenov, Lower bound for a number of vertices of some vertex Folkman graphs,, C. R. Acad. Bulg. Sci. , vol:55, issue:4, 2002, pages:33-36, Web of Science
|
2002
|
|
24
|
N. Nenov, On a class of vertex Folkman numbers., Serdica Math. J. , vol:28, 2002, pages:219-232, Ref
|
2002
|
|
25
|
N. Nenov, A generalization of a result of Dirac, Annuaire Univ. Sofia Fac. Math. Inform., vol:95, 2001, pages:39-69, Ref
|
2001
|
|
26
|
N. Nenov, Computation of the vertex Folkman numbers F(2, 2, 2, 3; 5) and F(2, 3, 3; 5)., Annuaire Univ. Sofia Fac. Math. Inform. , vol:95, 2001, pages:71-82, Ref
|
2001
|
|
27
|
N. Nenov, On the 3-coloring vertex Folkman number F(2, 2, 4)., Serdica Math. J., vol:27, 2001, pages:131-136, Ref
|
2001
|
|
28
|
N. Nenov, On the vertex Folkman number F(3, 4), C. R. Acad. Bulg. Sci., vol:54, issue:2, 2001, pages:23-26, Web of Science
|
2001
|
|
29
|
N. Nenov, On a class of vertex Folkman graphs., Annuaire Univ. Sofia Fac. Math. Inform., vol:94, 2000, pages:15-25, Ref
|
2000
|
|
30
|
N. Nenov, E. Nedialkov, On the number of independence of a class of graphs, C. R. Acad. Bulg. Sci., vol:53, 2000, pages:21-24, Web of Science, PhD
|
2000
|
|
31
|
N. Nenov, On the small graphs with chromatic number 5 without 4-cliques., Discrete Math , vol:188, 1998, pages:297-298, Web of Science
|
1998
|
|
32
|
N. Nenov, E. Nedialkov, Each 11-vertex graph without 4-cliques has a triangle-free 2 partition of vertices., Annuaire Univ. Sofia Fac. Math. Inform, vol:91, 1997, pages:127-147, Ref, PhD
|
1997
|
|
33
|
N. Nenov, On the (3, 4)-Ramsay graphs without 9-cliques. (in Russian), God. Sofij. Univ., Fak. Mat. Infor., vol:85, 1993, pages:71-81, Ref
|
1993
|
|
34
|
N. Nenov, Lower bounds for the number of vertices of some Ramsey graphs. (in Russian), Annuaire Univ. Sofia Fac. Math. Inform., vol:86, 1992, pages:11-15, Ref
|
1992
|
|
35
|
N. Nenov, N. Khadzhiivanov, On the generalized Turan's theorem and on an extension of this theorem. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:77, 1988, pages:231-242, Ref
|
1988
|
|
36
|
N. Nenov, N. Khadzhiivanov, On the relation of p-non-adjacency on graphs. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:78, 1988, pages:68-72
|
1988
|
|
37
|
N. Nenov, N. Khadzhiivanov, I. Pashov, Any 14-vertex graph with a unique triangle has no fewer than five 5-anticliques. (in Russian) , Serdica, vol:13, 1987, pages:199-209, Ref
|
1987
|
|
38
|
N. Nenov, N. Khadzhiivanov, Description of the graphs with 13 vertices having a unique triangle and a unique 5-anticlique. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:76, 1987, pages:91-107, Ref
|
1987
|
|
39
|
N. Nenov, N. Khadzhiivanov, On colorings of edges of complete graphs where the monochromatic triangles do not cover the set of all vertices. (in Russian), C. R. Acad. Bulg. Sci., vol:39, 1986, pages:31-34, Web of Science
|
1986
|
|
40
|
N. Nenov, On the Ramsey (3, 4)-graphs. (in Russian) , God. Sofij. Univ., Fak. Mat. Mekh., vol:73, 1986, pages:185-190, Ref
|
1986
|
|
41
|
N. Nenov, Some applications of Zykov's numbers in Ramsey's theory. (in Russian; English summary), God. Sofij. Univ., Fak. Mat. Mekh., vol:74, 1986, pages:29-50, Ref
|
1986
|
|
42
|
N. Nenov, N. Khadzhiivanov, The minimum number of monochromatic 4-cliques for noncovering 2-colorings of the edges of a complete graph. (in Russian), Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat., vol:22, 1986, pages:137-149
|
1986
|
|
43
|
N. Nenov, Up to isomorphism there exists only one minimal t-graph with nine vertices. (in Russian) , God. Sofij. Univ., Fak. Mat. Mekh., vol:73, 1986, pages:169-184, Ref
|
1986
|
|
44
|
N. Nenov, N. Khadzhiivanov, Erratum: "Any Ramsey graph without 5-cliques has more than 11 vertices". (in Russian), Serdica, vol:12, 1986, pages:204-204, Ref
|
1986
|
|
45
|
N. Nenov, N. Khadzhiivanov, On some colorings in two colors of the edges of the complete graph with nine vertices. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:71 (1976/1977), issue:, Part II, 1986, pages:92-115, Ref
|
1986
|
|
46
|
N. Nenov, N. Khadzhiivanov, I. Pashov, The minimum number of 5-anticliques of 14-vertex graphs with two 3-cliques is three. (in Russian), Godishnik Vissh. Ped. Inst. Shuman Prirod.-Mat. Fak., 1986, pages:23-37
|
1986
|
|
47
|
N. Nenov, A problem of Erdös and Hajnak in Ramsey theory. (in Bulgarian), Annuaire Univ. Sofia Fac. Math. Mech., vol:79, 1985, pages:5-13, Ref
|
1985
|
|
48
|
N. Nenov, N. Khadzhiivanov, Any Ramsey graph without 5-cliques has more than 11 vertices, (in Russian), Serdica, vol:11, 1985, pages:3341-3356, Ref
|
1985
|
|
49
|
N. Nenov, Application of the corona-product of two graphs in Ramsey theory. (in Russian), Annuaire Univ. Sofia Fac. Math. Mech., vol:79, 1985, pages:349-355, Ref
|
1985
|
|
50
|
N. Nenov, N. Khadzhiivanov, On the minimum of the number of 3-anticliques in n-vertex graphs without 3-cliques. (in Russian), Serdica, vol:11, 1985, pages:251-258, Ref
|
1985
|
|
51
|
N. Nenov, N. Khadzhiivanov, On two-colorings of the edges of complete graphs with a minimal number of monochromatic triangles. (in Russian) , Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat. , vol:21, 1985, pages:181-188
|
1985
|
|
52
|
N. Nenov, N. Khadzhiivanov, Relations and graphs. (in Bulgarian), Fiz.-Mat. Spis. Bulg. Akad. Nauk., vol:27, 1985, pages:314-318, Ref
|
1985
|
|
53
|
N. Nenov, N. Khadzhiivanov, On Ramsey graphs. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:78, 1984, pages:211-214, Ref
|
1984
|
|
54
|
N. Nenov, N. Khadzhiivanov, On the 4-cliques of some graphs without triangles. (in Russian) , Annuaire Univ. Sofia Fac. Math. Mech., vol:78, 1984, pages:186-208, Ref
|
1984
|
|
55
|
N. Nenov, N. Khadzhiivanov, I. Pashov, On the number of 3-cliques in some graphs without 4-anticliques., Godishnik Vissh, Ped. Inst. Shuman - Mat. Fak, vol:8, 1984, pages:11-29
|
1984
|
|
56
|
N. Nenov, N. Khadzhiivanov, On the number of triples of nonacquaintances at a party without triples of acquaintances (in Bulgarian), Fiz.-Mat. Spis. Bulg. Akad. Nauk., vol:26, 1984, pages:360-365, Ref
|
1984
|
|
57
|
N. Nenov, The chromatic number of any 10-vertex graph without 4-cliques is at most 4. (in Russian) , C. R. Acad. Bulg. Sci., vol:37, 1984, pages:301-304, Web of Science
|
1984
|
|
58
|
N. Nenov, I. Pashov, N. Khadzhiivanov, The existence and uniqueness of a 14-vertex graph with three 3-cliques and one 5-anticlique. (in Russian), Annuaire Univ. Sofia Fac. Math. Mech., vol:78, 1984, pages:40-55, Ref
|
1984
|
|
59
|
N. Nenov, N. Khadzhiivanov, The number of 5-vertex independent sets of 13-vertex graphs without triangles (in Russian) , Serdica, vol:10, 1984, pages:357-366, Ref
|
1984
|
|
60
|
N. Nenov, N. Khadzhiivanov, An example of the 16-vertex Ramsey (3, 3)-graph with clique number 4. (in Russian), Serdica, vol:9, 1983, pages:74-78, Ref
|
1983
|
|
61
|
N. Nenov, N. Khadzhiivanov, The minimal number of 5-anticliques in 14-vertex graphs without triangles. (in Russian) , C. R. Acad. Bulg. Sci., vol:36, 1983, pages:1155-1157, Web of Science
|
1983
|
|
62
|
N. Nenov, N. Khadzhiivanov, The minimum number of 4-anticliques of some graphs without triangles. (Russian), Annuaire Univ. Sofia Fac. Math. Mech., vol:77, 1983, pages:163-174, Ref
|
1983
|
|
63
|
N. Nenov, Zykov numbers and some of their applications in Ramsey theory. (in Russian), Serdica, vol:9, 1983, Ref
|
1983
|
|
64
|
N. Nenov, N. Khadzhiivanov, I. Pashov, On extremal 2-colorings of the edges of the complete graph with thirteen vertices., Godishnik Vissh, Ped. Inst. Shuman - Mat. Fak., vol:7B, 1983, pages:53-64
|
1983
|
|
65
|
N. Nenov, N. Khadzhiivanov, The number of discrete 4-vertex subgraphs of a graph without triangles. (in Russian), C. R. Acad. Bulg. Sci., vol:35, 1982, pages:909-912, Web of Science
|
1982
|
|
66
|
N. Nenov, I. Pashov, N. Khadzhiivanov, The number of monochromatic p-cliques in two-colorings of the edges of certain complete graphs. (in Russian) , C. R. Acad. Bulg. Sci., vol:35, 1982, pages:439-442, Web of Science
|
1982
|
|
67
|
N. Nenov, N. Khadzhiivanov, I. Pashov, Uniqueness of a 13-vertex graph with independence number 4 and with one triangle. (in Russian) , C. R. Acad. Bulg. Sci., vol:35, 1982, pages:1363-1366, Web of Science
|
1982
|
|
68
|
N. Nenov, An example of a 15-vertex Ramsey (3, 3)-graph with the clique number 4. (in Russian), C. R. Acad. Bulg. Sci., vol:34, 1981, pages:1487-1489
|
1981
|
|
69
|
N. Nenov, N. Khadzhiivanov, An extremal property of the Petersen graph (in Russian), Annuaire Univ. Sofia Fac. Math. Mech., vol:75, 1981, pages:115-121, Ref
|
1981
|
|
70
|
N. Nenov, N. Khadzhiivanov, Extremal problems for graphs with filters. (in Russian), PLISKA, Stud. Math. Bulg., vol:2, 1981, pages:119-123, Ref
|
1981
|
|
71
|
N. Nenov, Generalization of a certain theorem of Greenwood and Gleason on three-colorings of the edges of a complete graph with 17 vertices. (in Russian), C. R. Acad. Bulg. Sci., vol:34, 1981, pages:1209-1212, Web of Science
|
1981
|
|
72
|
N. Nenov, Lower bound for some constants related to Ramsey graphs. (in Russian), Annuaire Univ. Sofia Fac. Math. Mech. , vol:75, 1981, pages:27-38, Ref
|
1981
|
|
73
|
N. Nenov, On a certain constant connected with Ramsey (3, 4)-graphs. (in Russian), Serdica, vol:7, 1981, pages:366-371, Ref
|
1981
|
|
74
|
N. Nenov, Sharpening of Lin's inequalities relating to Ramsey theory (in Russian), C. R. Acad. Bulg. Sci., vol:34, 1981, pages:307-310
|
1981
|
|
75
|
N. Nenov, A new estimation from below for the Graham-Spencer number N(3, 5). (in Russian), Serdica, vol:6, 1980, pages:373-383, Ref
|
1980
|
|
76
|
N. Nenov, On an assumption of Lin about Ramsey-Graham-Spencer numbers. (in Russian), C. R. Acad. Bulg. Sci., vol:33, issue:9, 1980, pages:1171-1174, Web of Science
|
1980
|
|
77
|
N. Nenov, N. Khadzhiivanov, On minimal t-graphs. (in Russian) , Serdica, vol:6, 1980, pages:128-142, Ref
|
1980
|
|
78
|
N. Nenov, On the existence of a minimal t-graph with a given number of vertices. (in Russian), Serdica, vol:6, 1980, pages:270-274, Ref
|
1980
|
|
79
|
N. Nenov, On edgewise 2-colored graphs containing a monochromatic triangle. (in Russian), Serdica,, 1979, pages:303-305, Ref
|
1979
|
|
80
|
N. Nenov, N. Khadzhiivanov, On the Graham-Spencer number (in Russian), C. R. Acad. Bulg. Sci., vol:32, 1979, pages:155-158, Web of Science
|
1979
|
|
81
|
N. Nenov, N. Khadzhiivanov, On the number of nontrivial solutions of Fermat's equation xn + yn = zn in a Galois field. (in Russian), C. R. Acad. Bulg. Sci., vol:32, 1979, pages:557-560, Web of Science
|
1979
|
|
82
|
N. Nenov, On the existence of a minimal t-graph with nine vertices. (in Russian), Annuaire Univ. Sofia Fac. Math. Mech. , vol:72, 1978, pages:271-276, Ref
|
1978
|
|
83
|
N. Nenov, N. Khadzhiivanov, Sharpening of a theorem of Greenwood and Gleason on the colorings of the edges of a complete graph with nine vertices. (in Russian), C. R. Acad. Bulg. Sci. , vol:31, 1978, pages:631-633, Web of Science
|
1978
|
|
84
|
N. Nenov, N. Khadzhiivanov, Extremal problems for s-graphs and a theorem of Turan. (in Russian) , Serdica, vol:3, 1977, pages:117-125, Ref
|
1977
|
|
85
|
N. Nenov, N. Khadzhiivanov, Inequalities connected with graphs. (in Russian), C. R. Acad. Bulg. Sci. , vol:30, 1977, pages:635-638
|
1977
|
|
86
|
N. Nenov, N. Khadzhiivanov, p-sequences of graphs and extremal properties of Turan graphs. (in Russian), C. R. Acad. Bulg. Sci., vol:30, 1977, pages:635-638, Web of Science
|
1977
|
|
87
|
N. Nenov, N. Khadzhiivanov, The number of p-cliques in graphs with p-filters. (in Russian), C. R. Acad. Bulg. Sci., vol:30, 1977, pages:1231-1234, Web of Science
|
1977
|
|
88
|
N. Nenov, N. Khadzhiivanov, On the maximum number of edges of a graph. (in Russian), C. R. Acad. Bulg. Sci., vol:29, 1976, pages:1575-1578, Web of Science
|
1976
|
|
89
|
N. Nenov, On the representation of the abstract wreath product of groups by permutations. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh. , 1976, pages:565-572, Ref
|
1976
|
|
90
|
N. Nenov, N. Khadzhiivanov, A new proof of a theorem about the maximum number of p-cliques of graphs. (in Russian), Annuaire Univ. Sofia Fac. Math. Mech. , vol:70, 1975, pages:93-98, Ref
|
1975
|
|
91
|
N. Nenov, N. Khadzhiivanov, Maximum of the number of cliques of some graphs. (in Russian), God. Sofij. Univ., Fak. Mat. Mekh., vol:70, 1975, pages:23-26, Ref
|
1975
|
|
92
|
N. Nenov, On the multiply-transitive groups. (in Russian)., 98. God. Sofij. Univ., Fak. Mat. Mekh, vol:65, 1972, pages:219-224, Ref
|
1972
|
| Статия в сборник (на конференция и др.) |
|
1
|
A. Bojilov, N. Nenov, δ_k small sets in graphs, Math. and Education in Math., vol. 42, 2013, pages:101-109
|
2013
|
|
2
|
Asen Bojilov, Nedyalko Nenov, An equality for generalized chromatic graphs, Mathematics and Education, Proc. Forty First Spring Conf. Union Math., Borovetz, 2012, pages:143-147
|
2012
|
|
3
|
N. Nenov, Improvement of graph theory Wei's inequality, Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets,, 2006, pages:191-194
|
2006
|
|
4
|
N. Nenov, N. Kolev, New recurrent inequality on a class of vertex Folkman numbers., Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets, 2006, pages:164-168, PhD
|
2006
|
|
5
|
N. Nenov, E. Nedialkov, Computation of the vertex Folkman number F(4, 4; 6), Proceedings of the Third Euro Workshop on Optimal Codes and related topics, Sunny Beach, Bulgaria, 11-16 June 2001, 2001, pages:123-128, PhD
|
2001
|
|
6
|
N. Nenov, On a Ramsey type property for the 10 vertices graphs. (in Bulgarian with English summary), Mathematics and education in mathematics, Proc. 13th Spring Conf. Union Bulg. Math., Sunny Beach, 1984, pages:165-172
|
1984
|
|
7
|
N. Nenov, N. Khadzhiivanov, On the number of 5-anticliques in graphs which have 14 vertices and less than one 3-clique. (in Russian) , Mathematics and education in mathematics, Proc. 12th Spring Conf. Union Bulg. Math., Sunny Beach, 1983, pages:129-132
|
1983
|
|
8
|
N. Nenov, On proper 3-coloring of the edges of complete graphs. (in Bulgarian) , Mathematics and education in mathematics, Proc. 11th Spring Conf. Union Bulg. Math., Sunny Beach, 1982, pages:242-247
|
1982
|
|
9
|
N. Nenov, Certain remarks on Ramsey multiplicities. (in Russian), Mathematics and education in mathematics, Proc. 10th Spring Conf. Union Bulg. Math., Sunny Beach,, 1981, pages:176-179
|
1981
|
|
10
|
N. Nenov, On the independence number of minimal t-graphs. (in Russian), Mathematics and education in mathematics, Proc. 9th Spring Conf. Union Bulg. Math., Sunny Beach, 1980, pages:74-78
|
1980
|
|
11
|
N. Nenov, N. Khadzhiivanov, t-graphs with clique number 4. (in Russian), Mathematics and education in mathematics, Proc. 8th Spring Conf. Union Bulg. Math., Sunny Beach,, 1979, pages:565-577
|
1979
|
|
12
|
N. Nenov, N. Khadzhiivanov, On the maximum of the numbers of cliques in some graphs, Mathematics and education in mathematics, Proc. 6th Spring Conf. Union Bulg. Math., Sunny Beach,, 1977, pages:131-134
|
1977
|
|