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 2010 · math.COShow all

2 papers · 2 filters

math.CO2010

A Greedy Partition Lemma for Directed Domination

Yair Caro, Michael A. Henning

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V (D) ∖ S$ has an adjacent vertex $v$ in $S$ with $v$ directe…

math.CO2010★ 1 cited

Directed Domination in Oriented Graphs

Yair Caro, Michael A. Henning

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V (D) ∖ S$ has an adjacent vertex $v$ in $S$ with $v$ directe…