Y. Caro

activity

20022026

most citedUpper bounds on the k-forcing number of a graph

10 citations · 46 across the 64 of their papers we have counts for

collaborators

Showing 2011 · math.COShow all

2 papers · 2 filters

math.CO2011

Degrees in oriented hypergraphs and Ramsey p-chromatic number

Yair Caro, Adriana Hansberg

The family $D (k, m)$ of graphs having an orientation such that for every vertex $v \in V (G)$ either (outdegree) $°^{+} (v) \leq k$ or (indegree) $°^{-} (v) \leq m$ have been investigated re…

math.CO2011

Fair Domination in Graphs

Yair Caro, Adriana Hansberg, Michael A. Henning

A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$ ; that is, every two…