Nedyalko Nenov

most citedPartitions of graphs into small and large sets

4 citations · 6 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2012★ 4 cited

Partitions of graphs into small and large sets

Asen Bojilov, Yair Caro, Adriana Hansberg +1

Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V (G)$ \emph{ $k$ -small} if, for every vertex $v \in A$ , $° (v) \leq n - ∣ A ∣ + k$ . A subset $B \subseteq V(G…

math.CO2010★ 2 cited

Chromatic number of graphs and edge Folkman numbers

Nedyalko Dimov Nenov

In the paper we give a lower bound for the number of vertices of a given graph using its chromatic number. We find the graphs for which this bound is exact. The results are applied…